Base | Representation |
---|---|
bin | 11001100000110111111010… |
… | …010011011111000100100001 |
3 | 112201022012012011110010101212 |
4 | 121200313322103133010201 |
5 | 104201423012311120001 |
6 | 1034352355145235505 |
7 | 32430630566642405 |
oct | 3140677223370441 |
9 | 481265164403355 |
10 | 112210220020001 |
11 | 328320a59834a4 |
12 | 10703113792b95 |
13 | 4a7c4bc2b89bc |
14 | 1d9d009d49105 |
15 | ce8ca2ed37bb |
hex | 660dfa4df121 |
112210220020001 has 2 divisors, whose sum is σ = 112210220020002. Its totient is φ = 112210220020000.
The previous prime is 112210220019971. The next prime is 112210220020009. The reversal of 112210220020001 is 100020022012211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 65548697326225 + 46661522693776 = 8096215^2 + 6830924^2 .
It is a cyclic number.
It is not a de Polignac number, because 112210220020001 - 214 = 112210220003617 is a prime.
It is a super-2 number, since 2×1122102200200012 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112210220020009) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56105110010000 + 56105110010001.
It is an arithmetic number, because the mean of its divisors is an integer number (56105110010001).
Almost surely, 2112210220020001 is an apocalyptic number.
It is an amenable number.
112210220020001 is a deficient number, since it is larger than the sum of its proper divisors (1).
112210220020001 is an equidigital number, since it uses as much as digits as its factorization.
112210220020001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112210220020001 its reverse (100020022012211), we get a palindrome (212230242032212).
The spelling of 112210220020001 in words is "one hundred twelve trillion, two hundred ten billion, two hundred twenty million, twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •