Base | Representation |
---|---|
bin | 100000000010111111111… |
… | …111101100010001001111 |
3 | 21210112101012100212202002 |
4 | 200002333333230101033 |
5 | 242040144031301312 |
6 | 4403410324222515 |
7 | 315051445353635 |
oct | 40027777542117 |
9 | 7715335325662 |
10 | 2202244400207 |
11 | 779a6a608095 |
12 | 2b698723aa3b |
13 | 12c89485c4b7 |
14 | 78836a89355 |
15 | 3c4434de4c2 |
hex | 200bffec44f |
2202244400207 has 2 divisors, whose sum is σ = 2202244400208. Its totient is φ = 2202244400206.
The previous prime is 2202244400179. The next prime is 2202244400219. The reversal of 2202244400207 is 7020044422022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2202244400207 - 212 = 2202244396111 is a prime.
It is a super-5 number, since 5×22022444002075 (a number of 63 digits) contains 55555 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2202244400207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2202244400287) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1101122200103 + 1101122200104.
It is an arithmetic number, because the mean of its divisors is an integer number (1101122200104).
Almost surely, 22202244400207 is an apocalyptic number.
2202244400207 is a deficient number, since it is larger than the sum of its proper divisors (1).
2202244400207 is an equidigital number, since it uses as much as digits as its factorization.
2202244400207 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14336, while the sum is 29.
Adding to 2202244400207 its reverse (7020044422022), we get a palindrome (9222288822229).
The spelling of 2202244400207 in words is "two trillion, two hundred two billion, two hundred forty-four million, four hundred thousand, two hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •