Recognised as Number
-20,237
- Negative
- Odd
- 5 digits
-20,237 is an odd 5-digit integer and the negative of 20,237. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value20,237
Digit count5
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 7^3 × 59
Distinct prime factors27, 59
Number of divisors8
Sum of divisors σ(n)24,000
SquarefreeNohas a repeated prime factor
All divisors1, 7, 49, 59, 343, 413, 2,891, 20,2378 in total
Arithmetic
Representations
Decimal-20,237
Binary10011110000110115 bits
Octal47415
Hexadecimal4F0D
Base 36FM5
In wordsminus twenty thousand, two hundred and thirty-seven
Ordinalminus twenty thousand, two hundred and thirty-seventh
Scientific notation-2.0237 × 10^4
Engineering notation-20.237 × 10^3
In other bases
Ternary1000202112base 3; the most digit-efficient integer base after e: 10 digits
Quinary1121422base 5; one hand: 7 digits
Septenary113000base 7: 6 digits
Nonary30675base 9; each digit is two ternary digits: 5 digits
Duodecimalb865base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 4 digits
Vigesimal2abhbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal5:37:17base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT00T1T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111000100110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1011000011110011
Bit length15 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits7within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 14worth 16,384
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes24f 0d
Gray code110100010001011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1011000011110011two's complement
32-bit11111111111111111011000011110011two's complement
64-bit1111111111111111111111111111111111111111111111111011000011110011two's complement
One's complement0100111100001100at 16 bits, every bit flipped
Bits reversed1100111100001101at 16 bits
Rotated left by 10110000111100111at 16 bits, wrapping
Shifted left by 1-1001111000011010= -40,474, no wrap
Shifted right by 1-10011110000111= -10,118, discarding the low bit
These bits as a double9.99840647 × 10^-320≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-20,237 to the power 2409,536,169
-20,237 to the power 3-8,287,783,452,053
-20,237 to the power 4167,719,873,719,196,561
-20,237 to the power 5-3,394,147,084,455,380,804,957
First ten multiples-20,237, -40,474, -60,711, -80,948, -101,185, -121,422, -141,659, -161,896, -182,133, -202,370
Powers of twoBetween 2^14 (16,384) and 2^15 (32,768)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 7
Divisible by 11No, remainder 8
Divisible by 12No, remainder 5
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-2,023,700%
-20,237% as a decimal-202.37
-20,237% of 100-20,237
-20,237% of 1,000-202,370
As a fraction of 100-20,237/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -20,237
Nerdulate something else
Nothing in mind? Surprise me · today’s page