Recognised as Number
10,008,700,304,409
- Positive
- Odd
- Composite
- Perfect square
- 14 digits
10,008,700,304,409 is an odd 14-digit integer and a composite number. It has 15 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value10,008,700,304,409
Digit count14
Digit sum36
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 3,163,653²
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation3^4 × 351,517^2
Distinct prime factors23, 351,517
Number of divisors15
Sum of divisors σ(n)14,951,310,889,647
Aliquot sum4,942,610,585,238sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)6,672,447,887,688integers below n that share no factor with it
Carmichael function λ(n)1,112,074,647,948the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 6,672,447,887,688
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 81, 351,517, 1,054,551, 3,163,653, 9,490,959, 28,472,877, 123,564,201,289, 370,692,603,867, 1,112,077,811,601, 3,336,233,434,803, 10,008,700,304,40915 in total
Arithmetic
Previous number10,008,700,304,408
Next number10,008,700,304,410
Double20,017,400,608,818
Square100,174,081,783,476,809,264,839,281
Cube1,002,612,362,840,176,402,515,388,943,245,160,689,929
Square root3,163,653exact
Cube root21,550.593168399≈
Negation-10,008,700,304,409
Reciprocal9.99130726 × 10^-14≈
Representations
Decimal10,008,700,304,409
Binary1001000110100101010100000110101111000001100144 bits
Octal221512501536031
Hexadecimal91A5506BC19
Base 363JPXLQSK9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsten trillion, eight billion, seven hundred million, three hundred and four thousand, four hundred and nine
Ordinalten trillion, eight billion, seven hundred million, three hundred and four thousand, four hundred and ninth
Scientific notation1.00087003 × 10^13
Engineering notation10.0087 × 10^12
In other bases
Ternary1022102211012112101111210000base 3; the most digit-efficient integer base after e: 28 digits
Quinary2302440304234220114base 5; one hand: 19 digits
Septenary2052050631614262base 7: 16 digits
Nonary38384175344700base 9; each digit is two ternary digits: 14 digits
Duodecimal1157905593509base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimaljaj5igi109base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal3:34:31:16:15:29:0:9base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary110T110T111T0TTT11TTTTT10000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110010110111001010101000110111100110001101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010010001101001010101000001101011110000011001
Bit length44 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits25within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 43worth 8,796,093,022,208
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes609 1a 55 06 bc 19
Gray code11011001011101111111100001011110001000010101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010010001101001010101000001101011110000011001
One's complement1111111111111111111101101110010110101010111110010100001111100110at 64 bits, every bit flipped
Bits reversed1001100000111101011000001010101001011000100100000000000000000000at 64 bits
Rotated left by 10000000000000000000100100011010010101010000011010111100000110010at 64 bits, wrapping
Shifted left by 1100100011010010101010000011010111100000110010= 20,017,400,608,818, no wrap
Shifted right by 11001000110100101010100000110101111000001100= 5,004,350,152,204, discarding the low bit
These bits as a double4.94495498 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime8
Nearest square below10,008,700,304,409
Nearest square above10,008,706,631,716
Powers & multiples
10,008,700,304,409 to the power 2100,174,081,783,476,809,264,839,281
10,008,700,304,409 to the power 31,002,612,362,840,176,402,515,388,943,245,160,689,929
10,008,700,304,409 to the power 4100348466611627003196710318295… (53 digits)
10,008,700,304,409 to the power 5100435772832276755967367897883… (66 digits)
First ten multiples10,008,700,304,409, 20,017,400,608,818, 30,026,100,913,227, 40,034,801,217,636, 50,043,501,522,045, 60,052,201,826,454, 70,060,902,130,863, 80,069,602,435,272, 90,078,302,739,681, 100,087,003,044,090
Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 1
Divisible by 5No, remainder 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 9
Collatz (3n + 1) trajectory
Steps to reach 1351the total stopping time
Highest value reached39,045,794,370,9643× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps10,008,700,304,409 → 30,026,100,913,228 → 15,013,050,456,614 → 7,506,525,228,307 → 22,519,575,684,922 → 11,259,787,842,461 → 33,779,363,527,384 → 16,889,681,763,692 → 8,444,840,881,846 → 4,222,420,440,923 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage1.00087003 × 10^15%
10,008,700,304,409% as a decimal100,087,003,044.09
10,008,700,304,409% of 10010,008,700,304,409
10,008,700,304,409% of 1,000100,087,003,044,090
As a fraction of 10010,008,700,304,409/100
Read another way
As seconds317,156 years, 209 days and 17 hours
As bytes9.103 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 10,008,700,304,409
Nearby primes
Also reads as
10008700304409 (identifier)
- 14 characters
- Checksum fails
10008700304409 matches the shape of Luhn (cards, IMEI), GTIN-14 (case/carton). 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-14 (case/carton)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
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