Base | Representation |
---|---|
bin | 1010000110101111101100… |
… | …1110001000001000110101 |
3 | 1110100012102201010200122011 |
4 | 2201223323032020020311 |
5 | 2424020312023241041 |
6 | 35344153435204221 |
7 | 2224512641336653 |
oct | 241537316101065 |
9 | 43305381120564 |
10 | 11111000212021 |
11 | 35a416aa58126 |
12 | 12b54775a6671 |
13 | 6279bbc03798 |
14 | 2a5abd51ddd3 |
15 | 1440514c5e81 |
hex | a1afb388235 |
11111000212021 has 2 divisors, whose sum is σ = 11111000212022. Its totient is φ = 11111000212020.
The previous prime is 11111000212001. The next prime is 11111000212097. The reversal of 11111000212021 is 12021200011111.
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., 7455160611396 + 3655839600625 = 2730414^2 + 1912025^2 .
It is a cyclic number.
It is not a de Polignac number, because 11111000212021 - 213 = 11111000203829 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11111000211992 and 11111000212010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11111000212001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555500106010 + 5555500106011.
It is an arithmetic number, because the mean of its divisors is an integer number (5555500106011).
Almost surely, 211111000212021 is an apocalyptic number.
It is an amenable number.
11111000212021 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111000212021 is an equidigital number, since it uses as much as digits as its factorization.
11111000212021 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 11111000212021 its reverse (12021200011111), we get a palindrome (23132200223132).
The spelling of 11111000212021 in words is "eleven trillion, one hundred eleven billion, two hundred twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •