Nerdulator> put something in

Recognised as Number

-15,625,004

  • Negative
  • Even
  • 8 digits

-15,625,004 is an even 8-digit integer and the negative of 15,625,004. It has 12 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value15,625,004
Digit count8
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^2 × 23 × 169,837
Distinct prime factors32, 23, 169,837
Number of divisors12
Sum of divisors σ(n)28,532,784
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 23, 46, 92, 169,837, 339,674, 679,348, 3,906,251, 7,812,502, 15,625,00412 in total

Arithmetic

Previous number-15,625,005
Next number-15,625,003
Cube-3,814,700,195,313,250,000,064
Cube root-250.000021333
Negation15,625,004
Reciprocal-6.39999836 × 10^-8

Representations

Decimal-15,625,004
Binary11101110011010110010110024 bits
Octal73465454
HexadecimalEE6B2C
Base 369AWBW
In wordsminus fifteen million, six hundred and twenty-five thousand and four
Ordinalminus fifteen million, six hundred and twenty-five thousand and fourth
Scientific notation-1.5625004 × 10^7
Engineering notation-15.625004 × 10^6

In other bases

Ternary1002101211110212base 3; the most digit-efficient integer base after e: 16 digits
Quinary13000000004base 5; one hand: 11 digits
Septenary246544643base 7: 9 digits
Nonary32354425base 9; each digit is two ternary digits: 8 digits
Duodecimal52962b8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4hd2a4base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:12:20:16:44base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT0T1TT11TTTTT011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000101101001010111010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111000100011001010011010100
Bit length24 bitsto write the magnitude
Set bits14the population count, or Hamming weight
Zero bits10within that length
Bit parityeven14 set bits, so even; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes3ee 6b 2c
Gray code100110010101111010111010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111000100011001010011010100two's complement
64-bit1111111111111111111111111111111111111111000100011001010011010100two's complement
One's complement00000000111011100110101100101011at 32 bits, every bit flipped
Bits reversed00101011001010011000100011111111at 32 bits
Rotated left by 111111110001000110010100110101001at 32 bits, wrapping
Shifted left by 1-1110111001101011001011000= -31,250,008, no wrap
Shifted right by 1-11101110011010110010110= -7,812,502, discarding the low bit
These bits as a double7.71977769 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+15,625,006
Nearest square below15,618,304
Nearest square above15,626,209

Powers & multiples

-15,625,004 to the power 2244,140,750,000,016
-15,625,004 to the power 3-3,814,700,195,313,250,000,064
-15,625,004 to the power 459,604,705,810,570,312,504,000,000,256
-15,625,004 to the power 5-931,323,766,708,984,375,156,250,020,000,001,024
First ten multiples-15,625,004, -31,250,008, -46,875,012, -62,500,016, -78,125,020, -93,750,024, -109,375,028, -125,000,032, -140,625,036, -156,250,040
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7No, remainder 3
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 4
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 4

As a percentage & fraction

As a percentage-1,562,500,400%
-15,625,004% as a decimal-156,250.04
-15,625,004% of 100-15,625,004
-15,625,004% of 1,000-156,250,040
As a fraction of 100-15,625,004/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Also reads as

15625004 (identifier)

  • 8 characters
  • Checksum fails

15625004 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.

Open this reading on its own page →

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

Every value on this page was computed from “-15625004” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.