Base | Representation |
---|---|
bin | 1001001100100010011111… |
… | …0000110011111111110101 |
3 | 1022210121022101011210122111 |
4 | 2103020213300303333311 |
5 | 2311124332122401401 |
6 | 33300534415331021 |
7 | 2062332334663543 |
oct | 223104760637765 |
9 | 38717271153574 |
10 | 10111020122101 |
11 | 32490722a0a48 |
12 | 1173700220a71 |
13 | 584607ab9472 |
14 | 26d5399bad93 |
15 | 128026893e51 |
hex | 93227c33ff5 |
10111020122101 has 2 divisors, whose sum is σ = 10111020122102. Its totient is φ = 10111020122100.
The previous prime is 10111020122089. The next prime is 10111020122111. The reversal of 10111020122101 is 10122102011101.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8046838523025 + 2064181599076 = 2836695^2 + 1436726^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111020122101 - 217 = 10111019991029 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111020122111) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055510061050 + 5055510061051.
It is an arithmetic number, because the mean of its divisors is an integer number (5055510061051).
Almost surely, 210111020122101 is an apocalyptic number.
It is an amenable number.
10111020122101 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111020122101 is an equidigital number, since it uses as much as digits as its factorization.
10111020122101 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 13.
Adding to 10111020122101 its reverse (10122102011101), we get a palindrome (20233122133202).
The spelling of 10111020122101 in words is "ten trillion, one hundred eleven billion, twenty million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •