Recognised as Number
-25,409
- Negative
- Odd
- 5 digits
-25,409 is an odd 5-digit integer and the negative of 25,409. It has 2 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value25,409
Digit count5
Digit sum20
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 × 25,409
Distinct prime factors125,409
Number of divisors2
Sum of divisors σ(n)25,410
SquarefreeYesno repeated prime factor
All divisors1, 25,4092 in total
Arithmetic
Representations
Decimal-25,409
Binary11000110100000115 bits
Octal61501
Hexadecimal6341
Base 36JLT
In wordsminus twenty-five thousand, four hundred and nine
Ordinalminus twenty-five thousand, four hundred and ninth
Scientific notation-2.5409 × 10^4
Engineering notation-25.409 × 10^3
In other bases
Ternary1021212002base 3; the most digit-efficient integer base after e: 10 digits
Quinary1303114base 5; one hand: 7 digits
Septenary134036base 7: 6 digits
Nonary37762base 9; each digit is two ternary digits: 5 digits
Duodecimal12855base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal33a9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:3:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT010110T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110110111000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001110010111111
Bit length15 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits9within that length
Bit parityeven6 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
Bytes263 41
Gray code101001011100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001110010111111two's complement
32-bit11111111111111111001110010111111two's complement
64-bit1111111111111111111111111111111111111111111111111001110010111111two's complement
One's complement0110001101000000at 16 bits, every bit flipped
Bits reversed1111110100111001at 16 bits
Rotated left by 10011100101111111at 16 bits, wrapping
Shifted left by 1-1100011010000010= -50,818, no wrap
Shifted right by 1-11000110100001= -12,704, discarding the low bit
These bits as a double1.2553714 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-25,409 to the power 2645,617,281
-25,409 to the power 3-16,404,489,492,929
-25,409 to the power 4416,821,673,525,832,961
-25,409 to the power 5-10,591,021,902,617,889,706,049
First ten multiples-25,409, -50,818, -76,227, -101,636, -127,045, -152,454, -177,863, -203,272, -228,681, -254,090
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 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 9
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 9
As a percentage & fraction
As a percentage-2,540,900%
-25,409% as a decimal-254.09
-25,409% of 100-25,409
-25,409% of 1,000-254,090
As a fraction of 100-25,409/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -25,409
Nerdulate something else
Nothing in mind? Surprise me · today’s page