Base | Representation |
---|---|
bin | 10010101001010110… |
… | …011100000111001011 |
3 | 1220200022020022101101 |
4 | 102221112130013023 |
5 | 312000400213003 |
6 | 13110401402231 |
7 | 1306066356601 |
oct | 225126340713 |
9 | 56608208341 |
10 | 20021101003 |
11 | 8544431572 |
12 | 3a69039377 |
13 | 1b70b85237 |
14 | d7d019871 |
15 | 7c2a3811d |
hex | 4a959c1cb |
20021101003 has 2 divisors, whose sum is σ = 20021101004. Its totient is φ = 20021101002.
The previous prime is 20021100949. The next prime is 20021101013. The reversal of 20021101003 is 30010112002.
It is an a-pointer prime, because the next prime (20021101013) can be obtained adding 20021101003 to its sum of digits (10).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 20021101003 - 225 = 19987546571 is a prime.
It is a super-3 number, since 3×200211010033 (a number of 32 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (20021101013) 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, 10010550501 + 10010550502.
It is an arithmetic number, because the mean of its divisors is an integer number (10010550502).
Almost surely, 220021101003 is an apocalyptic number.
20021101003 is a deficient number, since it is larger than the sum of its proper divisors (1).
20021101003 is an equidigital number, since it uses as much as digits as its factorization.
20021101003 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
Adding to 20021101003 its reverse (30010112002), we get a palindrome (50031213005).
The spelling of 20021101003 in words is "twenty billion, twenty-one million, one hundred one thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •