Recognised as Number
-25,481
- Negative
- Odd
- 5 digits
-25,481 is an odd 5-digit integer and the negative of 25,481. It has 4 divisors and a digital root of 2.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value25,481
Digit count5
Digit sum20
Digit product320
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 83 × 307
Distinct prime factors283, 307
Number of divisors4
Sum of divisors σ(n)25,872
SquarefreeYesno repeated prime factor
All divisors1, 83, 307, 25,4814 in total
Arithmetic
Representations
Decimal-25,481
Binary11000111000100115 bits
Octal61611
Hexadecimal6389
Base 36JNT
In wordsminus twenty-five thousand, four hundred and eighty-one
Ordinalminus twenty-five thousand, four hundred and eighty-first
Scientific notation-2.5481 × 10^4
Engineering notation-25.481 × 10^3
In other bases
Ternary1021221202base 3; the most digit-efficient integer base after e: 10 digits
Quinary1303411base 5; one hand: 7 digits
Septenary134201base 7: 6 digits
Nonary37852base 9; each digit is two ternary digits: 5 digits
Duodecimal128b5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal33e1base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:4:41base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT010011T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110110110001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001110001110111
Bit length15 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits8within that length
Bit parityodd7 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
Bytes263 89
Gray code101001001001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001110001110111two's complement
32-bit11111111111111111001110001110111two's complement
64-bit1111111111111111111111111111111111111111111111111001110001110111two's complement
One's complement0110001110001000at 16 bits, every bit flipped
Bits reversed1110111000111001at 16 bits
Rotated left by 10011100011101111at 16 bits, wrapping
Shifted left by 1-1100011100010010= -50,962, no wrap
Shifted right by 1-11000111000101= -12,740, discarding the low bit
These bits as a double1.25892867 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-25,481 to the power 2649,281,361
-25,481 to the power 3-16,544,338,359,641
-25,481 to the power 4421,566,285,742,012,321
-25,481 to the power 5-10,741,930,526,992,215,951,401
First ten multiples-25,481, -50,962, -76,443, -101,924, -127,405, -152,886, -178,367, -203,848, -229,329, -254,810
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 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 2
Divisible by 10No, remainder 1
Divisible by 11No, remainder 5
Divisible by 12No, remainder 5
Divisible by 100No, remainder 81
As a percentage & fraction
As a percentage-2,548,100%
-25,481% as a decimal-254.81
-25,481% of 100-25,481
-25,481% of 1,000-254,810
As a fraction of 100-25,481/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -25,481
Nerdulate something else
Nothing in mind? Surprise me · today’s page