Base | Representation |
---|---|
bin | 10110101111001110000111… |
… | …110100110001111110110011 |
3 | 111010002002122111000120112121 |
4 | 112233032013310301332303 |
5 | 101101413100043010024 |
6 | 552404141411135111 |
7 | 30030622561420003 |
oct | 2657160764617663 |
9 | 433062574016477 |
10 | 100002002313139 |
11 | 2995567a293723 |
12 | b2710842a4497 |
13 | 43a51c0c20114 |
14 | 1a9a1a0b10003 |
15 | b8643548c8e4 |
hex | 5af387d31fb3 |
100002002313139 has 2 divisors, whose sum is σ = 100002002313140. Its totient is φ = 100002002313138.
The previous prime is 100002002313097. The next prime is 100002002313167. The reversal of 100002002313139 is 931313200200001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 100002002313139 - 231 = 99999854829491 is a prime.
It is a super-2 number, since 2×1000020023131392 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (100002002373139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50001001156569 + 50001001156570.
It is an arithmetic number, because the mean of its divisors is an integer number (50001001156570).
Almost surely, 2100002002313139 is an apocalyptic number.
100002002313139 is a deficient number, since it is larger than the sum of its proper divisors (1).
100002002313139 is an equidigital number, since it uses as much as digits as its factorization.
100002002313139 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 25.
The spelling of 100002002313139 in words is "one hundred trillion, two billion, two million, three hundred thirteen thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •