Base | Representation |
---|---|
bin | 11001000001000001111110… |
… | …111100011000001011000001 |
3 | 112102120000001012000210212012 |
4 | 121001001332330120023001 |
5 | 103410100040033324301 |
6 | 1025555225313342305 |
7 | 32113554010522403 |
oct | 3101017674301301 |
9 | 472500035023765 |
10 | 110022012011201 |
11 | 3206908956aa94 |
12 | 1040b005267995 |
13 | 495105376a564 |
14 | 1d2514552ab73 |
15 | cabdd1e14ebb |
hex | 64107ef182c1 |
110022012011201 has 2 divisors, whose sum is σ = 110022012011202. Its totient is φ = 110022012011200.
The previous prime is 110022012011167. The next prime is 110022012011207. The reversal of 110022012011201 is 102110210220011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 63640123330576 + 46381888680625 = 7977476^2 + 6810425^2 .
It is a cyclic number.
It is not a de Polignac number, because 110022012011201 - 230 = 110020938269377 is a prime.
It is a super-2 number, since 2×1100220120112012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (110022012011207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55011006005600 + 55011006005601.
It is an arithmetic number, because the mean of its divisors is an integer number (55011006005601).
Almost surely, 2110022012011201 is an apocalyptic number.
It is an amenable number.
110022012011201 is a deficient number, since it is larger than the sum of its proper divisors (1).
110022012011201 is an equidigital number, since it uses as much as digits as its factorization.
110022012011201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110022012011201 its reverse (102110210220011), we get a palindrome (212132222231212).
The spelling of 110022012011201 in words is "one hundred ten trillion, twenty-two billion, twelve million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •