Recognised as Number
-40,133
- Negative
- Odd
- 5 digits
-40,133 is an odd 5-digit integer and the negative of 40,133. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value40,133
Digit count5
Digit sum11
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 67 × 599
Distinct prime factors267, 599
Number of divisors4
Sum of divisors σ(n)40,800
SquarefreeYesno repeated prime factor
All divisors1, 67, 599, 40,1334 in total
Arithmetic
Representations
Decimal-40,133
Binary100111001100010116 bits
Octal116305
Hexadecimal9CC5
Base 36UYT
In wordsminus forty thousand, one hundred and thirty-three
Ordinalminus forty thousand, one hundred and thirty-third
Scientific notation-4.0133 × 10^4
Engineering notation-40.133 × 10^3
In other bases
Ternary2001001102base 3; the most digit-efficient integer base after e: 10 digits
Quinary2241013base 5; one hand: 7 digits
Septenary225002base 7: 6 digits
Nonary61042base 9; each digit is two ternary digits: 5 digits
Duodecimal1b285base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal506dbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal11:8:53base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT100T00TTT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1010011101001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111110110001100111011
Bit length16 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits8within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 15worth 32,768
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes29c c5
Gray code1101001010100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111110110001100111011two's complement
64-bit1111111111111111111111111111111111111111111111110110001100111011two's complement
One's complement00000000000000001001110011000100at 32 bits, every bit flipped
Bits reversed11011100110001101111111111111111at 32 bits
Rotated left by 111111111111111101100011001110111at 32 bits, wrapping
Shifted left by 1-10011100110001010= -80,266, no wrap
Shifted right by 1-100111001100011= -20,066, discarding the low bit
These bits as a double1.98283366 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-40,133 to the power 21,610,657,689
-40,133 to the power 3-64,640,525,032,637
-40,133 to the power 42,594,218,191,134,820,721
-40,133 to the power 5-104,113,758,664,813,759,995,893
First ten multiples-40,133, -80,266, -120,399, -160,532, -200,665, -240,798, -280,931, -321,064, -361,197, -401,330
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 2
Divisible by 8No, remainder 5
Divisible by 9No, remainder 2
Divisible by 10No, remainder 3
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33
As a percentage & fraction
As a percentage-4,013,300%
-40,133% as a decimal-401.33
-40,133% of 100-40,133
-40,133% of 1,000-401,330
As a fraction of 100-40,133/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -40,133
Nerdulate something else
Nothing in mind? Surprise me · today’s page