Base | Representation |
---|---|
bin | 100000010011101110110… |
… | …101000011110001001101 |
3 | 21212020202020211110221022 |
4 | 200103232311003301031 |
5 | 242333442230324323 |
6 | 4415541141443525 |
7 | 316255605500405 |
oct | 40235665036115 |
9 | 7766666743838 |
10 | 2220210011213 |
11 | 786649741597 |
12 | 2ba35ba105a5 |
13 | 13149890c15c |
14 | 7965cac3805 |
15 | 3cb458534c8 |
hex | 204eed43c4d |
2220210011213 has 2 divisors, whose sum is σ = 2220210011214. Its totient is φ = 2220210011212.
The previous prime is 2220210011203. The next prime is 2220210011221. The reversal of 2220210011213 is 3121100120222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1611064102729 + 609145908484 = 1269277^2 + 780478^2 .
It is a cyclic number.
It is not a de Polignac number, because 2220210011213 - 212 = 2220210007117 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2220210011191 and 2220210011200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2220210011203) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1110105005606 + 1110105005607.
It is an arithmetic number, because the mean of its divisors is an integer number (1110105005607).
Almost surely, 22220210011213 is an apocalyptic number.
It is an amenable number.
2220210011213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2220210011213 is an equidigital number, since it uses as much as digits as its factorization.
2220210011213 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 17.
Adding to 2220210011213 its reverse (3121100120222), we get a palindrome (5341310131435).
The spelling of 2220210011213 in words is "two trillion, two hundred twenty billion, two hundred ten million, eleven thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •