Base | Representation |
---|---|
bin | 1001001100100110100101… |
… | …1100111111001001000001 |
3 | 1022210201011011222020021201 |
4 | 2103021221130333021001 |
5 | 2311134111242033441 |
6 | 33301240025221201 |
7 | 2062401546451324 |
oct | 223115134771101 |
9 | 38721134866251 |
10 | 10112122221121 |
11 | 324958840a288 |
12 | 1173969331801 |
13 | 58475222366b |
14 | 26d6021047bb |
15 | 12808d4e1c31 |
hex | 9326973f241 |
10112122221121 has 2 divisors, whose sum is σ = 10112122221122. Its totient is φ = 10112122221120.
The previous prime is 10112122221077. The next prime is 10112122221199. The reversal of 10112122221121 is 12112222121101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8577348121521 + 1534774099600 = 2928711^2 + 1238860^2 .
It is an emirp because it is prime and its reverse (12112222121101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10112122221121 - 221 = 10112120123969 is a prime.
It is not a weakly prime, because it can be changed into another prime (10112126221121) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5056061110560 + 5056061110561.
It is an arithmetic number, because the mean of its divisors is an integer number (5056061110561).
Almost surely, 210112122221121 is an apocalyptic number.
It is an amenable number.
10112122221121 is a deficient number, since it is larger than the sum of its proper divisors (1).
10112122221121 is an equidigital number, since it uses as much as digits as its factorization.
10112122221121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 19.
Adding to 10112122221121 its reverse (12112222121101), we get a palindrome (22224344342222).
The spelling of 10112122221121 in words is "ten trillion, one hundred twelve billion, one hundred twenty-two million, two hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •