Base | Representation |
---|---|
bin | 1001001001000001000010… |
… | …00110001000001111011101 |
3 | 2122011122012101220212220001 |
4 | 10210200201012020033131 |
5 | 10113313323030400104 |
6 | 110430134541454301 |
7 | 4143151400403232 |
oct | 444404106101735 |
9 | 78148171825801 |
10 | 20101002200029 |
11 | 644a872789923 |
12 | 2307860b71391 |
13 | b2a693620b3a |
14 | 4d6c7243d789 |
15 | 24cd17088aa4 |
hex | 1248211883dd |
20101002200029 has 2 divisors, whose sum is σ = 20101002200030. Its totient is φ = 20101002200028.
The previous prime is 20101002199997. The next prime is 20101002200143. The reversal of 20101002200029 is 92000220010102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15275379507129 + 4825622692900 = 3908373^2 + 2196730^2 .
It is a cyclic number.
It is not a de Polignac number, because 20101002200029 - 25 = 20101002199997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20101002199979 and 20101002200015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20101002240029) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10050501100014 + 10050501100015.
It is an arithmetic number, because the mean of its divisors is an integer number (10050501100015).
Almost surely, 220101002200029 is an apocalyptic number.
It is an amenable number.
20101002200029 is a deficient number, since it is larger than the sum of its proper divisors (1).
20101002200029 is an equidigital number, since it uses as much as digits as its factorization.
20101002200029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 19.
The spelling of 20101002200029 in words is "twenty trillion, one hundred one billion, two million, two hundred thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •