Base | Representation |
---|---|
bin | 100000000010000010111… |
… | …111110011101000111101 |
3 | 21210102201212200210022122 |
4 | 200002002333303220331 |
5 | 242031100040121341 |
6 | 4403121005452325 |
7 | 315014210645546 |
oct | 40020277635075 |
9 | 7712655623278 |
10 | 2201221020221 |
11 | 779594975603 |
12 | 2b67405710a5 |
13 | 12c760827602 |
14 | 7877abb34cd |
15 | 3c3d374094b |
hex | 20082ff3a3d |
2201221020221 has 2 divisors, whose sum is σ = 2201221020222. Its totient is φ = 2201221020220.
The previous prime is 2201221020199. The next prime is 2201221020239. The reversal of 2201221020221 is 1220201221022.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1410419887321 + 790801132900 = 1187611^2 + 889270^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201221020221 - 226 = 2201153911357 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2201221020221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201226020221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100610510110 + 1100610510111.
It is an arithmetic number, because the mean of its divisors is an integer number (1100610510111).
Almost surely, 22201221020221 is an apocalyptic number.
It is an amenable number.
2201221020221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201221020221 is an equidigital number, since it uses as much as digits as its factorization.
2201221020221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 2201221020221 its reverse (1220201221022), we get a palindrome (3421422241243).
The spelling of 2201221020221 in words is "two trillion, two hundred one billion, two hundred twenty-one million, twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •