Base | Representation |
---|---|
bin | 1001101001010110110101… |
… | …11001110101000001010001 |
3 | 2210002212110011022211022201 |
4 | 10310223122321311001101 |
5 | 10240020112100200423 |
6 | 113040432043203201 |
7 | 4316350420246261 |
oct | 464533271650121 |
9 | 83085404284281 |
10 | 21212221100113 |
11 | 683906389a56a |
12 | 24670a1b16501 |
13 | bab3c4797614 |
14 | 5349698b97a1 |
15 | 26bba29182ad |
hex | 134adae75051 |
21212221100113 has 2 divisors, whose sum is σ = 21212221100114. Its totient is φ = 21212221100112.
The previous prime is 21212221100023. The next prime is 21212221100143. The reversal of 21212221100113 is 31100112221212.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19807778051649 + 1404443048464 = 4450593^2 + 1185092^2 .
It is a cyclic number.
It is not a de Polignac number, because 21212221100113 - 237 = 21074782146641 is a prime.
It is a super-2 number, since 2×212122211001132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (21212221100143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10606110550056 + 10606110550057.
It is an arithmetic number, because the mean of its divisors is an integer number (10606110550057).
Almost surely, 221212221100113 is an apocalyptic number.
It is an amenable number.
21212221100113 is a deficient number, since it is larger than the sum of its proper divisors (1).
21212221100113 is an equidigital number, since it uses as much as digits as its factorization.
21212221100113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 96, while the sum is 19.
Adding to 21212221100113 its reverse (31100112221212), we get a palindrome (52312333321325).
The spelling of 21212221100113 in words is "twenty-one trillion, two hundred twelve billion, two hundred twenty-one million, one hundred thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •