Base | Representation |
---|---|
bin | 1001101001010110101000… |
… | …10011001010111111111101 |
3 | 2210002212011102211202120102 |
4 | 10310223110103022333331 |
5 | 10240014400214200404 |
6 | 113040413044330445 |
7 | 4316344603425266 |
oct | 464532423127775 |
9 | 83085142752512 |
10 | 21212110303229 |
11 | 68390072a419a |
12 | 24670709a3a25 |
13 | bab3a7843631 |
14 | 534958cb796d |
15 | 26bb97d2e71e |
hex | 134ad44caffd |
21212110303229 has 2 divisors, whose sum is σ = 21212110303230. Its totient is φ = 21212110303228.
The previous prime is 21212110303217. The next prime is 21212110303231. The reversal of 21212110303229 is 92230301121212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18659177419129 + 2552932884100 = 4319627^2 + 1597790^2 .
It is a cyclic number.
It is not a de Polignac number, because 21212110303229 - 28 = 21212110302973 is a prime.
It is a super-3 number, since 3×212121103032293 (a number of 41 digits) contains 333 as substring.
Together with 21212110303231, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21212110303259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606055151614 + 10606055151615.
It is an arithmetic number, because the mean of its divisors is an integer number (10606055151615).
Almost surely, 221212110303229 is an apocalyptic number.
It is an amenable number.
21212110303229 is a deficient number, since it is larger than the sum of its proper divisors (1).
21212110303229 is an equidigital number, since it uses as much as digits as its factorization.
21212110303229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2592, while the sum is 29.
The spelling of 21212110303229 in words is "twenty-one trillion, two hundred twelve billion, one hundred ten million, three hundred three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •