Base | Representation |
---|---|
bin | 1001010011000000000000… |
… | …0000001000111110000101 |
3 | 1100012012211022011200011001 |
4 | 2110300000000020332011 |
5 | 2314434200140414341 |
6 | 33423533203213301 |
7 | 2103342145044505 |
oct | 224600000107605 |
9 | 40165738150131 |
10 | 10222022201221 |
11 | 3291154054a16 |
12 | 119111a677231 |
13 | 591c17aa099c |
14 | 274a69ccda05 |
15 | 12ad7192dd31 |
hex | 94c00008f85 |
10222022201221 has 2 divisors, whose sum is σ = 10222022201222. Its totient is φ = 10222022201220.
The previous prime is 10222022201213. The next prime is 10222022201227. The reversal of 10222022201221 is 12210222022201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7194035908900 + 3027986292321 = 2682170^2 + 1740111^2 .
It is a cyclic number.
It is not a de Polignac number, because 10222022201221 - 23 = 10222022201213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10222022201227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5111011100610 + 5111011100611.
It is an arithmetic number, because the mean of its divisors is an integer number (5111011100611).
Almost surely, 210222022201221 is an apocalyptic number.
It is an amenable number.
10222022201221 is a deficient number, since it is larger than the sum of its proper divisors (1).
10222022201221 is an equidigital number, since it uses as much as digits as its factorization.
10222022201221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 256, while the sum is 19.
Adding to 10222022201221 its reverse (12210222022201), we get a palindrome (22432244223422).
The spelling of 10222022201221 in words is "ten trillion, two hundred twenty-two billion, twenty-two million, two hundred one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •