Base | Representation |
---|---|
bin | 100000001100001011100… |
… | …011011111100101110101 |
3 | 21211110211012012101221111 |
4 | 200030023203133211311 |
5 | 242220341103330003 |
6 | 4412120423115021 |
7 | 315550643565511 |
oct | 40141343374565 |
9 | 7743735171844 |
10 | 2212102011253 |
11 | 783168a09182 |
12 | 2b88785a2a71 |
13 | 1307a5bb4144 |
14 | 790cdd45141 |
15 | 3c81db22e6d |
hex | 2030b8df975 |
2212102011253 has 2 divisors, whose sum is σ = 2212102011254. Its totient is φ = 2212102011252.
The previous prime is 2212102011187. The next prime is 2212102011277. The reversal of 2212102011253 is 3521102012122.
2212102011253 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1798192495089 + 413909516164 = 1340967^2 + 643358^2 .
It is a cyclic number.
It is not a de Polignac number, because 2212102011253 - 237 = 2074663057781 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2212102011283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106051005626 + 1106051005627.
It is an arithmetic number, because the mean of its divisors is an integer number (1106051005627).
Almost surely, 22212102011253 is an apocalyptic number.
It is an amenable number.
2212102011253 is a deficient number, since it is larger than the sum of its proper divisors (1).
2212102011253 is an equidigital number, since it uses as much as digits as its factorization.
2212102011253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 480, while the sum is 22.
Adding to 2212102011253 its reverse (3521102012122), we get a palindrome (5733204023375).
The spelling of 2212102011253 in words is "two trillion, two hundred twelve billion, one hundred two million, eleven thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •