Base | Representation |
---|---|
bin | 10100100000101111… |
… | …11010001010000101 |
3 | 1001102110020201102112 |
4 | 22100113322022011 |
5 | 140023100334341 |
6 | 5020415550405 |
7 | 536614325453 |
oct | 122027721205 |
9 | 31373221375 |
10 | 11012121221 |
11 | 4741067732 |
12 | 2173b2b405 |
13 | 10665ac87a |
14 | 7667479d3 |
15 | 446b85aeb |
hex | 2905fa285 |
11012121221 has 2 divisors, whose sum is σ = 11012121222. Its totient is φ = 11012121220.
The previous prime is 11012121199. The next prime is 11012121223. The reversal of 11012121221 is 12212121011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6318501121 + 4693620100 = 79489^2 + 68510^2 .
It is an emirp because it is prime and its reverse (12212121011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11012121221 - 26 = 11012121157 is a prime.
Together with 11012121223, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 11012121196 and 11012121205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012121223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506060610 + 5506060611.
It is an arithmetic number, because the mean of its divisors is an integer number (5506060611).
Almost surely, 211012121221 is an apocalyptic number.
It is an amenable number.
11012121221 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012121221 is an equidigital number, since it uses as much as digits as its factorization.
11012121221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 11012121221 its reverse (12212121011), we get a palindrome (23224242232).
The spelling of 11012121221 in words is "eleven billion, twelve million, one hundred twenty-one thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •