Base | Representation |
---|---|
bin | 10010101001010010… |
… | …001111100101001101 |
3 | 1220200020011102121021 |
4 | 102221102033211031 |
5 | 312000110013401 |
6 | 13110322034141 |
7 | 1306054126102 |
oct | 225122174515 |
9 | 56606142537 |
10 | 20020001101 |
11 | 8543850161 |
12 | 3a687a8951 |
13 | 1b7088b6c9 |
14 | d7cc10aa9 |
15 | 7c28bc2a1 |
hex | 4a948f94d |
20020001101 has 2 divisors, whose sum is σ = 20020001102. Its totient is φ = 20020001100.
The previous prime is 20020001081. The next prime is 20020001117. The reversal of 20020001101 is 10110002002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10362222025 + 9657779076 = 101795^2 + 98274^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020001101 - 215 = 20019968333 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20020001161) 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, 10010000550 + 10010000551.
It is an arithmetic number, because the mean of its divisors is an integer number (10010000551).
Almost surely, 220020001101 is an apocalyptic number.
It is an amenable number.
20020001101 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020001101 is an equidigital number, since it uses as much as digits as its factorization.
20020001101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 7.
Adding to 20020001101 its reverse (10110002002), we get a palindrome (30130003103).
Subtracting from 20020001101 its reverse (10110002002), we obtain a palindrome (9909999099).
The spelling of 20020001101 in words is "twenty billion, twenty million, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •