Base | Representation |
---|---|
bin | 100000000010000001110… |
… | …000000011001001010101 |
3 | 21210102200102100112220222 |
4 | 200002001300003021111 |
5 | 242031024212042323 |
6 | 4403114541404125 |
7 | 315013535145344 |
oct | 40020160031125 |
9 | 7712612315828 |
10 | 2201200112213 |
11 | 779584095063 |
12 | 2b6735569645 |
13 | 12c7593b6acb |
14 | 787780cdb5b |
15 | 3c3d19b09c8 |
hex | 20081c03255 |
2201200112213 has 2 divisors, whose sum is σ = 2201200112214. Its totient is φ = 2201200112212.
The previous prime is 2201200112179. The next prime is 2201200112219. The reversal of 2201200112213 is 3122110021022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1408774338724 + 792425773489 = 1186918^2 + 890183^2 .
It is a cyclic number.
It is not a de Polignac number, because 2201200112213 - 26 = 2201200112149 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 = 2201200112191 and 2201200112200.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2201200112219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100600056106 + 1100600056107.
It is an arithmetic number, because the mean of its divisors is an integer number (1100600056107).
Almost surely, 22201200112213 is an apocalyptic number.
It is an amenable number.
2201200112213 is a deficient number, since it is larger than the sum of its proper divisors (1).
2201200112213 is an equidigital number, since it uses as much as digits as its factorization.
2201200112213 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 2201200112213 its reverse (3122110021022), we get a palindrome (5323310133235).
The spelling of 2201200112213 in words is "two trillion, two hundred one billion, two hundred million, one hundred twelve thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •