Base | Representation |
---|---|
bin | 1010000000011010011001… |
… | …0110010110010000000101 |
3 | 1102221210121101100000201122 |
4 | 2200012212112112100011 |
5 | 2420230002220334341 |
6 | 35222201502403325 |
7 | 2213611552665653 |
oct | 240064626262005 |
9 | 42853541300648 |
10 | 11002202121221 |
11 | 356200a2a8203 |
12 | 1298373290545 |
13 | 61a67071906c |
14 | 2a071bc05dd3 |
15 | 1412d4b9494b |
hex | a01a6596405 |
11002202121221 has 2 divisors, whose sum is σ = 11002202121222. Its totient is φ = 11002202121220.
The previous prime is 11002202121191. The next prime is 11002202121227. The reversal of 11002202121221 is 12212120220011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10203162789121 + 799039332100 = 3194239^2 + 893890^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002202121221 - 222 = 11002197926917 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11002202121221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002202121227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501101060610 + 5501101060611.
It is an arithmetic number, because the mean of its divisors is an integer number (5501101060611).
Almost surely, 211002202121221 is an apocalyptic number.
It is an amenable number.
11002202121221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002202121221 is an equidigital number, since it uses as much as digits as its factorization.
11002202121221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 11002202121221 its reverse (12212120220011), we get a palindrome (23214322341232).
The spelling of 11002202121221 in words is "eleven trillion, two billion, two hundred two million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •