Nerdulator> put something in

Recognised as Number

-10,059,425

  • Negative
  • Odd
  • 8 digits

-10,059,425 is an odd 8-digit integer and the negative of 10,059,425. It has 12 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value10,059,425
Digit count8
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 5^2 × 211 × 1,907
Distinct prime factors35, 211, 1,907
Number of divisors12
Sum of divisors σ(n)12,539,376
SquarefreeNohas a repeated prime factor
All divisors1, 5, 25, 211, 1,055, 1,907, 5,275, 9,535, 47,675, 402,377, 2,011,885, 10,059,42512 in total

Arithmetic

Previous number-10,059,426
Next number-10,059,424
Cube-1,017,933,649,768,072,390,625
Cube root-215.869384052≈
Negation10,059,425
Reciprocal-9.94092605 × 10^-8≈

Representations

Decimal-10,059,425
Binary10011001011111101010000124 bits
Octal46277241
Hexadecimal997EA1
Base 365ZLWH
In wordsminus ten million, fifty-nine thousand, four hundred and twenty-five
Ordinalminus ten million, fifty-nine thousand, four hundred and twenty-fifth
Scientific notation-1.0059425 × 10^7
Engineering notation-10.059425 × 10^6

In other bases

Ternary200221001221022base 3; the most digit-efficient integer base after e: 15 digits
Quinary10033400200base 5; one hand: 11 digits
Septenary151334525base 7: 9 digits
Nonary20831838base 9; each digit is two ternary digits: 8 digits
Duodecimal3451515base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32h8b5base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:34:17:5base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T01T0T101TT01digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110111000011010100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111011001101000000101011111
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 odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes399 7e a1
Gray code110101011100000111110001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001101000000101011111two's complement
64-bit1111111111111111111111111111111111111111011001101000000101011111two's complement
One's complement00000000100110010111111010100000at 32 bits, every bit flipped
Bits reversed11111010100000010110011011111111at 32 bits
Rotated left by 111111110110011010000001010111111at 32 bits, wrapping
Shifted left by 1-1001100101111110101000010= -20,118,850, no wrap
Shifted right by 1-10011001011111101010001= -5,029,712, discarding the low bit
These bits as a double4.97001631 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,059,427
Nearest square below10,055,241
Nearest square above10,061,584

Powers & multiples

-10,059,425 to the power 2101,192,031,330,625
-10,059,425 to the power 3-1,017,933,649,768,072,390,625
-10,059,425 to the power 410,239,827,204,818,191,608,062,890,625
-10,059,425 to the power 5-103,006,773,779,828,237,116,938,043,525,390,625
First ten multiples-10,059,425, -20,118,850, -30,178,275, -40,237,700, -50,297,125, -60,356,550, -70,415,975, -80,475,400, -90,534,825, -100,594,250
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,005,942,500%
-10,059,425% as a decimal-100,594.25
-10,059,425% of 100-10,059,425
-10,059,425% of 1,000-100,594,250
As a fraction of 100-10,059,425/100

Keep nerding

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

Also reads as

10059425 (identifier)

  • 8 characters
  • Checksum valid

10059425 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for GTIN-8 (EAN-8). 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 validGS1 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 “-10059425” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.