Base | Representation |
---|---|
bin | 1001001101001011011011… |
… | …0111101110110000010101 |
3 | 1022211122200100110212100002 |
4 | 2103102312313232300111 |
5 | 2311314334304341432 |
6 | 33305553200301045 |
7 | 2063201604004634 |
oct | 223226667566025 |
9 | 38748610425302 |
10 | 10122011012117 |
11 | 32527a2377324 |
12 | 1175869011785 |
13 | 585669b74394 |
14 | 26dc9d59951b |
15 | 12846b733e62 |
hex | 934b6deec15 |
10122011012117 has 2 divisors, whose sum is σ = 10122011012118. Its totient is φ = 10122011012116.
The previous prime is 10122011012111. The next prime is 10122011012171. The reversal of 10122011012117 is 71121011022101.
It is a happy number.
Together with next prime (10122011012171) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9579359262916 + 542651749201 = 3095054^2 + 736649^2 .
It is a cyclic number.
It is not a de Polignac number, because 10122011012117 - 210 = 10122011011093 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122011012111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061005506058 + 5061005506059.
It is an arithmetic number, because the mean of its divisors is an integer number (5061005506059).
Almost surely, 210122011012117 is an apocalyptic number.
It is an amenable number.
10122011012117 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122011012117 is an equidigital number, since it uses as much as digits as its factorization.
10122011012117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 20.
Adding to 10122011012117 its reverse (71121011022101), we get a palindrome (81243022034218).
The spelling of 10122011012117 in words is "ten trillion, one hundred twenty-two billion, eleven million, twelve thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •