Base | Representation |
---|---|
bin | 1001000110110010000011… |
… | …1011011001110001001101 |
3 | 1022110011000221102111221121 |
4 | 2101230200323121301031 |
5 | 2303014311012204213 |
6 | 33143301024400541 |
7 | 2052231461051623 |
oct | 221544073316115 |
9 | 38404027374847 |
10 | 10012121209933 |
11 | 3210131453497 |
12 | 11584bb176151 |
13 | 5781a644b8ab |
14 | 268836c9d513 |
15 | 12568915788d |
hex | 91b20ed9c4d |
10012121209933 has 2 divisors, whose sum is σ = 10012121209934. Its totient is φ = 10012121209932.
The previous prime is 10012121209903. The next prime is 10012121210023. The reversal of 10012121209933 is 33990212121001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9968555919204 + 43565290729 = 3157302^2 + 208723^2 .
It is an emirp because it is prime and its reverse (33990212121001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10012121209933 - 225 = 10012087655501 is a prime.
It is a super-2 number, since 2×100121212099332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10012121209903) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006060604966 + 5006060604967.
It is an arithmetic number, because the mean of its divisors is an integer number (5006060604967).
Almost surely, 210012121209933 is an apocalyptic number.
It is an amenable number.
10012121209933 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012121209933 is an equidigital number, since it uses as much as digits as its factorization.
10012121209933 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5832, while the sum is 34.
The spelling of 10012121209933 in words is "ten trillion, twelve billion, one hundred twenty-one million, two hundred nine thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •