Base | Representation |
---|---|
bin | 10100011111100011… |
… | …10000101111111101 |
3 | 1001101202102122222212 |
4 | 22033301300233331 |
5 | 140013020334323 |
6 | 5015421350205 |
7 | 536433326066 |
oct | 121761605775 |
9 | 31352378885 |
10 | 11002121213 |
11 | 4736457566 |
12 | 2170708365 |
13 | 10644bacc5 |
14 | 7652a356d |
15 | 445d5cb78 |
hex | 28fc70bfd |
11002121213 has 2 divisors, whose sum is σ = 11002121214. Its totient is φ = 11002121212.
The previous prime is 11002121167. The next prime is 11002121227. The reversal of 11002121213 is 31212120011.
It is an a-pointer prime, because the next prime (11002121227) can be obtained adding 11002121213 to its sum of digits (14).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8871190969 + 2130930244 = 94187^2 + 46162^2 .
It is a cyclic number.
It is not a de Polignac number, because 11002121213 - 218 = 11001859069 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11002121243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5501060606 + 5501060607.
It is an arithmetic number, because the mean of its divisors is an integer number (5501060607).
Almost surely, 211002121213 is an apocalyptic number.
It is an amenable number.
11002121213 is a deficient number, since it is larger than the sum of its proper divisors (1).
11002121213 is an equidigital number, since it uses as much as digits as its factorization.
11002121213 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 11002121213 its reverse (31212120011), we get a palindrome (42214241224).
The spelling of 11002121213 in words is "eleven billion, two million, one hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •