Base | Representation |
---|---|
bin | 1001000110110010000011… |
… | …0111100101101010111101 |
3 | 1022110011000212112201110002 |
4 | 2101230200313211222331 |
5 | 2303014310233210414 |
6 | 33143300551124045 |
7 | 2052231446415653 |
oct | 221544067455275 |
9 | 38404025481402 |
10 | 10012120210109 |
11 | 3210130930296 |
12 | 11584ba973625 |
13 | 5781a618b794 |
14 | 268836abcdd3 |
15 | 12568900b4de |
hex | 91b20de5abd |
10012120210109 has 2 divisors, whose sum is σ = 10012120210110. Its totient is φ = 10012120210108.
The previous prime is 10012120210093. The next prime is 10012120210121. The reversal of 10012120210109 is 90101202121001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8100598284025 + 1911521926084 = 2846155^2 + 1382578^2 .
It is a cyclic number.
It is not a de Polignac number, because 10012120210109 - 24 = 10012120210093 is a prime.
It is a super-2 number, since 2×100121202101092 (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 (10012120210009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006060105054 + 5006060105055.
It is an arithmetic number, because the mean of its divisors is an integer number (5006060105055).
Almost surely, 210012120210109 is an apocalyptic number.
It is an amenable number.
10012120210109 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012120210109 is an equidigital number, since it uses as much as digits as its factorization.
10012120210109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 20.
The spelling of 10012120210109 in words is "ten trillion, twelve billion, one hundred twenty million, two hundred ten thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •