Base | Representation |
---|---|
bin | 110010000001011100111011… |
… | …001000111110010100000111 |
3 | 1001211221222212202101210102201 |
4 | 302001130323020332110013 |
5 | 212314003301103324033 |
6 | 2055523323113015331 |
7 | 64224425115210664 |
oct | 6201347310762407 |
9 | 1054858782353381 |
10 | 220002102011143 |
11 | 64110405162481 |
12 | 20811a6a9b4547 |
13 | 959b155bb5c9a |
14 | 3c482310d2a6b |
15 | 1a67b5d73847d |
hex | c8173b23e507 |
220002102011143 has 2 divisors, whose sum is σ = 220002102011144. Its totient is φ = 220002102011142.
The previous prime is 220002102010979. The next prime is 220002102011179. The reversal of 220002102011143 is 341110201200022.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 220002102011143 - 225 = 220002068456711 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 220002102011143.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220002102011443) 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, 110001051005571 + 110001051005572.
It is an arithmetic number, because the mean of its divisors is an integer number (110001051005572).
Almost surely, 2220002102011143 is an apocalyptic number.
220002102011143 is a deficient number, since it is larger than the sum of its proper divisors (1).
220002102011143 is an equidigital number, since it uses as much as digits as its factorization.
220002102011143 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 220002102011143 its reverse (341110201200022), we get a palindrome (561112303211165).
The spelling of 220002102011143 in words is "two hundred twenty trillion, two billion, one hundred two million, eleven thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •