Base | Representation |
---|---|
bin | 100000000001000000010… |
… | …011000101010111011101 |
3 | 21210022211220001200021201 |
4 | 200001000103011113131 |
5 | 242021302103000333 |
6 | 4402413553155501 |
7 | 314644402304314 |
oct | 40010023052735 |
9 | 7708756050251 |
10 | 2200102000093 |
11 | 77907024a188 |
12 | 2b648985bb91 |
13 | 12c612a4751a |
14 | 786b232327b |
15 | 3c36a39e17d |
hex | 200404c55dd |
2200102000093 has 2 divisors, whose sum is σ = 2200102000094. Its totient is φ = 2200102000092.
The previous prime is 2200102000081. The next prime is 2200102000127. The reversal of 2200102000093 is 3900002010022.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1425344678884 + 774757321209 = 1193878^2 + 880203^2 .
It is a cyclic number.
It is not a de Polignac number, because 2200102000093 - 225 = 2200068445661 is a prime.
It is a super-3 number, since 3×22001020000933 (a number of 38 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2200102000093.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2200102000493) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1100051000046 + 1100051000047.
It is an arithmetic number, because the mean of its divisors is an integer number (1100051000047).
Almost surely, 22200102000093 is an apocalyptic number.
It is an amenable number.
2200102000093 is a deficient number, since it is larger than the sum of its proper divisors (1).
2200102000093 is an equidigital number, since it uses as much as digits as its factorization.
2200102000093 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 19.
The spelling of 2200102000093 in words is "two trillion, two hundred billion, one hundred two million, ninety-three", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •