Recognised as Number
-24,169
- Negative
- Odd
- 5 digits
-24,169 is an odd 5-digit integer and the negative of 24,169. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value24,169
Digit count5
Digit sum22
Digit product432
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 24,169
Distinct prime factors124,169
Number of divisors2
Sum of divisors σ(n)24,170
SquarefreeYesno repeated prime factor
All divisors1, 24,1692 in total
Arithmetic
Representations
Decimal-24,169
Binary10111100110100115 bits
Octal57151
Hexadecimal5E69
Base 36IND
In wordsminus twenty-four thousand, one hundred and sixty-nine
Ordinalminus twenty-four thousand, one hundred and sixty-ninth
Scientific notation-2.4169 × 10^4
Engineering notation-24.169 × 10^3
In other bases
Ternary1020011011base 3; the most digit-efficient integer base after e: 10 digits
Quinary1233134base 5; one hand: 7 digits
Septenary130315base 7: 6 digits
Nonary36134base 9; each digit is two ternary digits: 5 digits
Duodecimal11ba1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal3089base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal6:42:49base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT100TT0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110011011101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1010000110010111
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
Bytes25e 69
Gray code111000101011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1010000110010111two's complement
32-bit11111111111111111010000110010111two's complement
64-bit1111111111111111111111111111111111111111111111111010000110010111two's complement
One's complement0101111001101000at 16 bits, every bit flipped
Bits reversed1110100110000101at 16 bits
Rotated left by 10100001100101111at 16 bits, wrapping
Shifted left by 1-1011110011010010= -48,338, no wrap
Shifted right by 1-10111100110101= -12,084, discarding the low bit
These bits as a double1.19410726 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-24,169 to the power 2584,140,561
-24,169 to the power 3-14,118,093,218,809
-24,169 to the power 4341,220,195,005,394,721
-24,169 to the power 5-8,246,950,893,085,385,011,849
First ten multiples-24,169, -48,338, -72,507, -96,676, -120,845, -145,014, -169,183, -193,352, -217,521, -241,690
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 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 9
Divisible by 11No, remainder 2
Divisible by 12No, remainder 1
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-2,416,900%
-24,169% as a decimal-241.69
-24,169% of 100-24,169
-24,169% of 1,000-241,690
As a fraction of 100-24,169/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -24,169
Nerdulate something else
Nothing in mind? Surprise me · today’s page