Base | Representation |
---|---|
bin | 1001000111000000100000… |
… | …1100000000111010110001 |
3 | 1022110112001100010102120212 |
4 | 2101300020030000322301 |
5 | 2303100232240221424 |
6 | 33145142024113505 |
7 | 2052426562433045 |
oct | 221601014007261 |
9 | 38415040112525 |
10 | 10016001101489 |
11 | 3211842561439 |
12 | 1159202605895 |
13 | 578674208c06 |
14 | 268ac42aa025 |
15 | 125814aa510e |
hex | 91c08300eb1 |
10016001101489 has 2 divisors, whose sum is σ = 10016001101490. Its totient is φ = 10016001101488.
The previous prime is 10016001101429. The next prime is 10016001101521. The reversal of 10016001101489 is 98410110061001.
It is an a-pointer prime, because the next prime (10016001101521) can be obtained adding 10016001101489 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8949102165025 + 1066898936464 = 2991505^2 + 1032908^2 .
It is a cyclic number.
It is not a de Polignac number, because 10016001101489 - 28 = 10016001101233 is a prime.
It is a super-2 number, since 2×100160011014892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10016001101429) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5008000550744 + 5008000550745.
It is an arithmetic number, because the mean of its divisors is an integer number (5008000550745).
Almost surely, 210016001101489 is an apocalyptic number.
It is an amenable number.
10016001101489 is a deficient number, since it is larger than the sum of its proper divisors (1).
10016001101489 is an equidigital number, since it uses as much as digits as its factorization.
10016001101489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 32.
The spelling of 10016001101489 in words is "ten trillion, sixteen billion, one million, one hundred one thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •