Base | Representation |
---|---|
bin | 1010000011011111011111… |
… | …11011110111100011110001 |
3 | 2220021201100101200021000001 |
4 | 11001233233323313203301 |
5 | 10344223213330334301 |
6 | 115005143521430001 |
7 | 4441260626060044 |
oct | 501575773674361 |
9 | 86251311607001 |
10 | 22110222121201 |
11 | 705498aa7a975 |
12 | 259113879b301 |
13 | c44ca6076066 |
14 | 5661d75d0c5b |
15 | 28520e6d4c01 |
hex | 141befef78f1 |
22110222121201 has 2 divisors, whose sum is σ = 22110222121202. Its totient is φ = 22110222121200.
The previous prime is 22110222121153. The next prime is 22110222121241. The reversal of 22110222121201 is 10212122201122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15856841664225 + 6253380456976 = 3982065^2 + 2500676^2 .
It is a cyclic number.
It is not a de Polignac number, because 22110222121201 - 221 = 22110220024049 is a prime.
It is not a weakly prime, because it can be changed into another prime (22110222121241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11055111060600 + 11055111060601.
It is an arithmetic number, because the mean of its divisors is an integer number (11055111060601).
Almost surely, 222110222121201 is an apocalyptic number.
It is an amenable number.
22110222121201 is a deficient number, since it is larger than the sum of its proper divisors (1).
22110222121201 is an equidigital number, since it uses as much as digits as its factorization.
22110222121201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 22110222121201 its reverse (10212122201122), we get a palindrome (32322344322323).
The spelling of 22110222121201 in words is "twenty-two trillion, one hundred ten billion, two hundred twenty-two million, one hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •