Base | Representation |
---|---|
bin | 1001000110110010000011… |
… | …0111001010110100001011 |
3 | 1022110011000212100010112221 |
4 | 2101230200313022310023 |
5 | 2303014310221200412 |
6 | 33143300544514511 |
7 | 2052231445450156 |
oct | 221544067126413 |
9 | 38404025303487 |
10 | 10012120100107 |
11 | 3210130865684 |
12 | 11584ba91ba37 |
13 | 5781a61506a8 |
14 | 268836a90c9d |
15 | 125688ed8b07 |
hex | 91b20dcad0b |
10012120100107 has 2 divisors, whose sum is σ = 10012120100108. Its totient is φ = 10012120100106.
The previous prime is 10012120100071. The next prime is 10012120100113. The reversal of 10012120100107 is 70100102121001.
Together with previous prime (10012120100071) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is an emirp because it is prime and its reverse (70100102121001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10012120100107 - 231 = 10009972616459 is a prime.
It is a super-2 number, since 2×100121201001072 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (10012120100137) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5006060050053 + 5006060050054.
It is an arithmetic number, because the mean of its divisors is an integer number (5006060050054).
Almost surely, 210012120100107 is an apocalyptic number.
10012120100107 is a deficient number, since it is larger than the sum of its proper divisors (1).
10012120100107 is an equidigital number, since it uses as much as digits as its factorization.
10012120100107 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 10012120100107 its reverse (70100102121001), we get a palindrome (80112222221108).
The spelling of 10012120100107 in words is "ten trillion, twelve billion, one hundred twenty million, one hundred thousand, one hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •