Recognised as Number
-25,537
- Negative
- Odd
- 5 digits
-25,537 is an odd 5-digit integer and the negative of 25,537. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value25,537
Digit count5
Digit sum22
Digit product1,050
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 25,537
Distinct prime factors125,537
Number of divisors2
Sum of divisors σ(n)25,538
SquarefreeYesno repeated prime factor
All divisors1, 25,5372 in total
Arithmetic
Representations
Decimal-25,537
Binary11000111100000115 bits
Octal61701
Hexadecimal63C1
Base 36JPD
In wordsminus twenty-five thousand, five hundred and thirty-seven
Ordinalminus twenty-five thousand, five hundred and thirty-seventh
Scientific notation-2.5537 × 10^4
Engineering notation-25.537 × 10^3
In other bases
Ternary1022000211base 3; the most digit-efficient integer base after e: 10 digits
Quinary1304122base 5; one hand: 7 digits
Septenary134311base 7: 6 digits
Nonary38024base 9; each digit is two ternary digits: 5 digits
Duodecimal12941base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal33ghbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal7:5:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryTT0100T1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1110110001000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1001110000111111
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 c1
Gray code101001000100001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1001110000111111two's complement
32-bit11111111111111111001110000111111two's complement
64-bit1111111111111111111111111111111111111111111111111001110000111111two's complement
One's complement0110001111000000at 16 bits, every bit flipped
Bits reversed1111110000111001at 16 bits
Rotated left by 10011100001111111at 16 bits, wrapping
Shifted left by 1-1100011110000010= -51,074, no wrap
Shifted right by 1-11000111100001= -12,768, discarding the low bit
These bits as a double1.26169544 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-25,537 to the power 2652,138,369
-25,537 to the power 3-16,653,657,529,153
-25,537 to the power 4425,284,452,321,980,161
-25,537 to the power 5-10,860,489,058,946,407,371,457
First ten multiples-25,537, -51,074, -76,611, -102,148, -127,685, -153,222, -178,759, -204,296, -229,833, -255,370
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 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 6
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-2,553,700%
-25,537% as a decimal-255.37
-25,537% of 100-25,537
-25,537% of 1,000-255,370
As a fraction of 100-25,537/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -25,537
Nerdulate something else
Nothing in mind? Surprise me · today’s page