Recognised as Number
9,997,598,808,401
- Positive
- Odd
- Composite
- 13 digits
9,997,598,808,401 is an odd 13-digit integer and a composite number. It has 8 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value9,997,598,808,401
Digit count13
Digit sum77
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
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation17 × 122,321 × 4,807,793
Distinct prime factors317, 122,321, 4,807,793
Number of divisors8
Sum of divisors σ(n)10,585,781,598,024
Aliquot sum588,182,789,623sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)9,409,425,879,040integers below n that share no factor with it
Carmichael function λ(n)3,341,415,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 9,409,425,879,040
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 17, 122,321, 2,079,457, 4,807,793, 81,732,481, 588,094,047,553, 9,997,598,808,4018 in total
Arithmetic
Previous number9,997,598,808,400
Next number9,997,598,808,402
Double19,995,197,616,802
Square99,951,981,933,741,095,108,176,801
Cube999,279,815,478,088,252,189,553,195,869,232,105,201
Square root3,161,897.97564706≈irrational, shown to 9 decimal places
Cube root21,542.622358787≈
Negation-9,997,598,808,401
Reciprocal1.00024018 × 10^-13≈
Representations
Decimal9,997,598,808,401
Binary1001000101111011111101010011010110010101000144 bits
Octal221367724654521
Hexadecimal917BF535951
Base 363JKU077F5
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsnine trillion, nine hundred and ninety-seven billion, five hundred and ninety-eight million, eight hundred and eight thousand, four hundred and one
Ordinalnine trillion, nine hundred and ninety-seven billion, five hundred and ninety-eight million, eight hundred and eight thousand, four hundred and first
Scientific notation9.99759881 × 10^12
Engineering notation9.997599 × 10^12
In other bases
Ternary1022101202112211222002012012base 3; the most digit-efficient integer base after e: 28 digits
Quinary2302300040243332101base 5; one hand: 19 digits
Septenary2051205550505561base 7: 16 digits
Nonary38352484862165base 9; each digit is two ternary digits: 14 digits
Duodecimal1155727742695base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits
Vigesimaljaac9cb101base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits
Sexagesimal3:34:16:59:39:40:6:41base 60; Babylonian, and still how an hour and a circle are divided: 8 digits
Balanced ternary110T11TT10TT00TT00T01T1TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary110010110100011000011010101001010100101010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
0000000000000000000010010001011110111111010100110101100101010001
Bit length44 bitsto write the magnitude
Set bits24the population count, or Hamming weight
Zero bits20within that length
Bit parityeven24 set bits, so even; 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 17 bf 53 59 51
Gray code11011001110001100000111110101111010111111001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
64-bit0000000000000000000010010001011110111111010100110101100101010001
One's complement1111111111111111111101101110100001000000101011001010011010101110at 64 bits, every bit flipped
Bits reversed1000101010011010110010101111110111101000100100000000000000000000at 64 bits
Rotated left by 10000000000000000000100100010111101111110101001101011001010100010at 64 bits, wrapping
Shifted left by 1100100010111101111110101001101011001010100010= 19,995,197,616,802, no wrap
Shifted right by 11001000101111011111101010011010110010101000= 4,998,799,404,200, discarding the low bit
These bits as a double4.93947011 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Distance to nearest prime10
Nearest square below9,997,592,638,609
Nearest square above9,997,598,962,404
Powers & multiples
9,997,598,808,401 to the power 299,951,981,933,741,095,108,176,801
9,997,598,808,401 to the power 3999,279,815,478,088,252,189,553,195,869,232,105,201
9,997,598,808,401 to the power 4999039869248290626621579381020… (52 digits)
9,997,598,808,401 to the power 5998799980634180121231803962804… (65 digits)
First ten multiples9,997,598,808,401, 19,995,197,616,802, 29,992,796,425,203, 39,990,395,233,604, 49,987,994,042,005, 59,985,592,850,406, 69,983,191,658,807, 79,980,790,467,208, 89,978,389,275,609, 99,975,988,084,010
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 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 1
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 6
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
Collatz (3n + 1) trajectory
Steps to reach 1426the total stopping time
Highest value reached42,704,587,097,6204× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps9,997,598,808,401 → 29,992,796,425,204 → 14,996,398,212,602 → 7,498,199,106,301 → 22,494,597,318,904 → 11,247,298,659,452 → 5,623,649,329,726 → 2,811,824,664,863 → 8,435,473,994,590 → 4,217,736,997,295 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage999,759,880,840,100%
9,997,598,808,401% as a decimal99,975,988,084.01
9,997,598,808,401% of 1009,997,598,808,401
9,997,598,808,401% of 1,00099,975,988,084,010
As a fraction of 1009,997,598,808,401/100
Read another way
As seconds316,804 years, 288 days and 4 hours
As bytes9.093 TiB
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from 9,997,598,808,401
Nearby primes
Also reads as
9997598808401 (identifier)
- 13 characters
- Checksum fails
9997598808401 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). 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
ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
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