Base | Representation |
---|---|
bin | 10010101000001010… |
… | …001011110000001001 |
3 | 1220121220121201022201 |
4 | 102220022023300021 |
5 | 311430241023144 |
6 | 13104405120201 |
7 | 1305434432053 |
oct | 225012136011 |
9 | 56556551281 |
10 | 20001111049 |
11 | 8534118847 |
12 | 3a623b9061 |
13 | 1b699a656a |
14 | d7a4d48d3 |
15 | 7c0dda1d4 |
hex | 4a828bc09 |
20001111049 has 2 divisors, whose sum is σ = 20001111050. Its totient is φ = 20001111048.
The previous prime is 20001110989. The next prime is 20001111071. The reversal of 20001111049 is 94011110002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18792297225 + 1208813824 = 137085^2 + 34768^2 .
It is a cyclic number.
It is not a de Polignac number, because 20001111049 - 29 = 20001110537 is a prime.
It is not a weakly prime, because it can be changed into another prime (20001711049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10000555524 + 10000555525.
It is an arithmetic number, because the mean of its divisors is an integer number (10000555525).
Almost surely, 220001111049 is an apocalyptic number.
It is an amenable number.
20001111049 is a deficient number, since it is larger than the sum of its proper divisors (1).
20001111049 is an equidigital number, since it uses as much as digits as its factorization.
20001111049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 19.
The spelling of 20001111049 in words is "twenty billion, one million, one hundred eleven thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •