Base | Representation |
---|---|
bin | 1001001100100010110111… |
… | …0010000101101100010101 |
3 | 1022210121120102020000202012 |
4 | 2103020231302011230111 |
5 | 2311130034001320041 |
6 | 33300552424154005 |
7 | 2062335002313245 |
oct | 223105562055425 |
9 | 38717512200665 |
10 | 10111121120021 |
11 | 32491143041a9 |
12 | 117372a008905 |
13 | 5846229bc24c |
14 | 26d54918bb25 |
15 | 1280306943eb |
hex | 9322dc85b15 |
10111121120021 has 2 divisors, whose sum is σ = 10111121120022. Its totient is φ = 10111121120020.
The previous prime is 10111121119991. The next prime is 10111121120053. The reversal of 10111121120021 is 12002112111101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5621972944900 + 4489148175121 = 2371070^2 + 2118761^2 .
It is a cyclic number.
It is not a de Polignac number, because 10111121120021 - 234 = 10093941250837 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10111121119978 and 10111121120005.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10111120120021) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5055560560010 + 5055560560011.
It is an arithmetic number, because the mean of its divisors is an integer number (5055560560011).
Almost surely, 210111121120021 is an apocalyptic number.
It is an amenable number.
10111121120021 is a deficient number, since it is larger than the sum of its proper divisors (1).
10111121120021 is an equidigital number, since it uses as much as digits as its factorization.
10111121120021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 10111121120021 its reverse (12002112111101), we get a palindrome (22113233231122).
The spelling of 10111121120021 in words is "ten trillion, one hundred eleven billion, one hundred twenty-one million, one hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •