Base | Representation |
---|---|
bin | 1001001100100010110100… |
… | …1000000101101101000101 |
3 | 1022210121112122111122212102 |
4 | 2103020231020011231011 |
5 | 2311130023142010041 |
6 | 33300551352201445 |
7 | 2062334506606154 |
oct | 223105510055505 |
9 | 38717478448772 |
10 | 10111110110021 |
11 | 3249109074228 |
12 | 1173726399285 |
13 | 584620635a5b |
14 | 26d54792359b |
15 | 12802e71c09b |
hex | 9322d205b45 |
10111110110021 has 2 divisors, whose sum is σ = 10111110110022. Its totient is φ = 10111110110020.
The previous prime is 10111110109949. The next prime is 10111110110033. The reversal of 10111110110021 is 12001101111101.
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., 6028645408900 + 4082464701121 = 2455330^2 + 2020511^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111110110021 - 210 = 10111110108997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111110109984 and 10111110110011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111110110041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055555055010 + 5055555055011.
It is an arithmetic number, because the mean of its divisors is an integer number (5055555055011).
Almost surely, 210111110110021 is an apocalyptic number.
It is an amenable number.
10111110110021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111110110021 is an equidigital number, since it uses as much as digits as its factorization.
10111110110021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2, while the sum is 11.
Adding to 10111110110021 its reverse (12001101111101), we get a palindrome (22112211221122).
The spelling of 10111110110021 in words is "ten trillion, one hundred eleven billion, one hundred ten million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •