Base | Representation |
---|---|
bin | 11001010000101110111000… |
… | …111101010000100100000001 |
3 | 112120101011011020220012220212 |
4 | 121100232320331100210001 |
5 | 104030234343130041001 |
6 | 1032143034400443505 |
7 | 32254532620201505 |
oct | 3120567075204401 |
9 | 476334136805825 |
10 | 111101022112001 |
11 | 32444751648049 |
12 | 10564157619595 |
13 | 49cba20a5941c |
14 | 1d61465070305 |
15 | cc9ed4cb17bb |
hex | 650bb8f50901 |
111101022112001 has 2 divisors, whose sum is σ = 111101022112002. Its totient is φ = 111101022112000.
The previous prime is 111101022111967. The next prime is 111101022112013. The reversal of 111101022112001 is 100211220101111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95363330122225 + 15737691989776 = 9765415^2 + 3967076^2 .
It is a cyclic number.
It is not a de Polignac number, because 111101022112001 - 234 = 111083842242817 is a prime.
It is a super-2 number, since 2×1111010221120012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (111101022112901) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55550511056000 + 55550511056001.
It is an arithmetic number, because the mean of its divisors is an integer number (55550511056001).
Almost surely, 2111101022112001 is an apocalyptic number.
It is an amenable number.
111101022112001 is a deficient number, since it is larger than the sum of its proper divisors (1).
111101022112001 is an equidigital number, since it uses as much as digits as its factorization.
111101022112001 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 111101022112001 its reverse (100211220101111), we get a palindrome (211312242213112).
The spelling of 111101022112001 in words is "one hundred eleven trillion, one hundred one billion, twenty-two million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •