Base | Representation |
---|---|
bin | 1001001101001011110101… |
… | …0111110111110011110111 |
3 | 1022211122221221202011022012 |
4 | 2103102331113313303313 |
5 | 2311320100221213421 |
6 | 33310012054354435 |
7 | 2063204400153434 |
oct | 223227527676367 |
9 | 38748857664265 |
10 | 10122120101111 |
11 | 3252848a06517 |
12 | 117589965ba1b |
13 | 58568664ab95 |
14 | 26dcadc74b8b |
15 | 1284760d195b |
hex | 934bd5f7cf7 |
10122120101111 has 2 divisors, whose sum is σ = 10122120101112. Its totient is φ = 10122120101110.
The previous prime is 10122120101099. The next prime is 10122120101131. The reversal of 10122120101111 is 11110102122101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 10122120101111 - 218 = 10122119838967 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10122120101131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5061060050555 + 5061060050556.
It is an arithmetic number, because the mean of its divisors is an integer number (5061060050556).
Almost surely, 210122120101111 is an apocalyptic number.
10122120101111 is a deficient number, since it is larger than the sum of its proper divisors (1).
10122120101111 is an equidigital number, since it uses as much as digits as its factorization.
10122120101111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10122120101111 its reverse (11110102122101), we get a palindrome (21232222223212).
The spelling of 10122120101111 in words is "ten trillion, one hundred twenty-two billion, one hundred twenty million, one hundred one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •