Recognised as Number
-20,047
- Negative
- Odd
- 5 digits
-20,047 is an odd 5-digit integer and the negative of 20,047. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value20,047
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 20,047
Distinct prime factors120,047
Number of divisors2
Sum of divisors σ(n)20,048
SquarefreeYesno repeated prime factor
All divisors1, 20,0472 in total
Arithmetic
Representations
Decimal-20,047
Binary10011100100111115 bits
Octal47117
Hexadecimal4E4F
Base 36FGV
In wordsminus twenty thousand and forty-seven
Ordinalminus twenty thousand and forty-seventh
Scientific notation-2.0047 × 10^4
Engineering notation-20.047 × 10^3
In other bases
Ternary1000111111base 3; the most digit-efficient integer base after e: 10 digits
Quinary1120142base 5; one hand: 7 digits
Septenary112306base 7: 6 digits
Nonary30444base 9; each digit is two ternary digits: 5 digits
Duodecimalb727base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal2a27base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:34:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT000TTTTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111011011110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011000110110001
Bit length15 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits6within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes24e 4f
Gray code110100101101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011000110110001two's complement
32-bit11111111111111111011000110110001two's complement
64-bit1111111111111111111111111111111111111111111111111011000110110001two's complement
One's complement0100111001001110at 16 bits, every bit flipped
Bits reversed1000110110001101at 16 bits
Rotated left by 10110001101100011at 16 bits, wrapping
Shifted left by 1-1001110010011110= -40,094, no wrap
Shifted right by 1-10011100101000= -10,023, discarding the low bit
These bits as a double9.904534 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-20,047 to the power 2401,882,209
-20,047 to the power 3-8,056,532,643,823
-20,047 to the power 4161,509,309,910,719,681
-20,047 to the power 5-3,237,777,135,780,197,445,007
First ten multiples-20,047, -40,094, -60,141, -80,188, -100,235, -120,282, -140,329, -160,376, -180,423, -200,470
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 5
Divisible by 12No, remainder 7
Divisible by 100No, remainder 47
As a percentage & fraction
As a percentage-2,004,700%
-20,047% as a decimal-200.47
-20,047% of 100-20,047
-20,047% of 1,000-200,470
As a fraction of 100-20,047/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -20,047
Nerdulate something else
Nothing in mind? Surprise me · today’s page