Recognised as Number
-15,625,000
- Negative
- Even
- Perfect cube
- 8 digits
-15,625,000 is an even 8-digit integer and the negative of 15,625,000. It has 40 divisors and a digital root of 1.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value15,625,000
Digit count8
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Perfect cubeYes, -250³
Factors & divisors
Prime factorisation−1 × 2^3 × 5^9
Distinct prime factors22, 5
Number of divisors40
Sum of divisors σ(n)36,621,090
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 20, 25, 40, 50, 100, 125, 200, 250, 500, 625, 1,000, 1,250, 2,500, 3,125, 5,000, 6,250, 12,500, 15,625, 25,000, 31,250, 62,500, 78,125, 125,000, 156,250, 312,500, 390,625, 625,000, 781,250, 1,562,500, 1,953,125, 3,125,000, 3,906,250, 7,812,500, 15,625,00040 in total
Arithmetic
Previous number-15,625,001
Next number-15,624,999
Double-31,250,000
Half-7,812,500
Square244,140,625,000,000
Cube-3,814,697,265,625,000,000,000
Cube root-250
Negation15,625,000
Reciprocal-6.4 × 10^-8≈
Representations
Decimal-15,625,000
Binary11101110011010110010100024 bits
Octal73465450
HexadecimalEE6B28
Base 369AWBS
In wordsminus fifteen million, six hundred and twenty-five thousand
Ordinalminus fifteen million, six hundred and twenty-five thousandth
Scientific notation-1.5625 × 10^7
Engineering notation-15.625 × 10^6
In other bases
Ternary1002101211110201base 3; the most digit-efficient integer base after e: 16 digits
Quinary13000000000base 5; one hand: 11 digits
Septenary246544636base 7: 9 digits
Nonary32354421base 9; each digit is two ternary digits: 8 digits
Duodecimal52962b4base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4hd2a0base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:12:20:16:40base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0T1TT11TTTTT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000101101001010100101000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111000100011001010011011000
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 33 trailing zeros
Power of twoNo
Bytes3ee 6b 28
Gray code100110010101111010111100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111000100011001010011011000two's complement
64-bit1111111111111111111111111111111111111111000100011001010011011000two's complement
One's complement00000000111011100110101100100111at 32 bits, every bit flipped
Bits reversed00011011001010011000100011111111at 32 bits
Rotated left by 111111110001000110010100110110001at 32 bits, wrapping
Shifted left by 1-1110111001101011001010000= -31,250,000, no wrap
Shifted right by 1-11101110011010110010100= -7,812,500, discarding the low bit
These bits as a double7.71977572 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-15,625,000 to the power 2244,140,625,000,000
-15,625,000 to the power 3-3,814,697,265,625,000,000,000
-15,625,000 to the power 459,604,644,775,390,625,000,000,000,000
-15,625,000 to the power 5-931,322,574,615,478,515,625,000,000,000,000,000
First ten multiples-15,625,000, -31,250,000, -46,875,000, -62,500,000, -78,125,000, -93,750,000, -109,375,000, -125,000,000, -140,625,000, -156,250,000
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8Yes
Divisible by 9No, remainder 1
Divisible by 10Yes
Divisible by 11No, remainder 6
Divisible by 12No, remainder 4
Divisible by 100Yes
As a percentage & fraction
As a percentage-1,562,500,000%
-15,625,000% as a decimal-156,250
-15,625,000% of 100-15,625,000
-15,625,000% of 1,000-156,250,000
As a fraction of 100-15,625,000/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -15,625,000
Also reads as
15625000 (identifier)
- 8 characters
- Checksum fails
15625000 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
What this does not tell you
ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked
Nerdulate something else
Nothing in mind? Surprise me · today’s page