Base | Representation |
---|---|
bin | 10110110010000110101110… |
… | …100010000001010000011001 |
3 | 111010210001021121221122011002 |
4 | 112302012232202001100121 |
5 | 101113140022332431014 |
6 | 553035202400314345 |
7 | 30051140602603514 |
oct | 2662065642012031 |
9 | 433701247848132 |
10 | 100200220202009 |
11 | 29a217470a9404 |
12 | b2a35830129b5 |
13 | 43baabcc73765 |
14 | 1aa5a06253d7b |
15 | b8b68723ddde |
hex | 5b21ae881419 |
100200220202009 has 2 divisors, whose sum is σ = 100200220202010. Its totient is φ = 100200220202008.
The previous prime is 100200220201979. The next prime is 100200220202081. The reversal of 100200220202009 is 900202022002001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 99547453158409 + 652767043600 = 9977347^2 + 807940^2 .
It is a cyclic number.
It is not a de Polignac number, because 100200220202009 - 240 = 99100708574233 is a prime.
It is a super-3 number, since 3×1002002202020093 (a number of 43 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (100200220202099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50100110101004 + 50100110101005.
It is an arithmetic number, because the mean of its divisors is an integer number (50100110101005).
Almost surely, 2100200220202009 is an apocalyptic number.
It is an amenable number.
100200220202009 is a deficient number, since it is larger than the sum of its proper divisors (1).
100200220202009 is an equidigital number, since it uses as much as digits as its factorization.
100200220202009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 288, while the sum is 20.
The spelling of 100200220202009 in words is "one hundred trillion, two hundred billion, two hundred twenty million, two hundred two thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •