Base | Representation |
---|---|
bin | 1001000110010111101101… |
… | …11010100001001001000011 |
3 | 2121211221120021202211100100 |
4 | 10203023312322201021003 |
5 | 10110321141122400003 |
6 | 110320302500253443 |
7 | 4133452636221054 |
oct | 443136672411103 |
9 | 77757507684310 |
10 | 20010100200003 |
11 | 641526599a871 |
12 | 22b21120a1283 |
13 | b21c37984a44 |
14 | 4d26cb82472b |
15 | 24a796937ba3 |
hex | 1232f6ea1243 |
20010100200003 has 24 divisors (see below), whose sum is σ = 29687931551408. Its totient is φ = 12978090983232.
The previous prime is 20010100199989. The next prime is 20010100200023. The reversal of 20010100200003 is 30000200101002.
It is a happy number.
It is not a de Polignac number, because 20010100200003 - 213 = 20010100191811 is a prime.
It is a super-2 number, since 2×200101002000032 (a number of 27 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20010100200023) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 294376 + ... + 6332997.
Almost surely, 220010100200003 is an apocalyptic number.
20010100200003 is a deficient number, since it is larger than the sum of its proper divisors (9677831351405).
20010100200003 is a wasteful number, since it uses less digits than its factorization.
20010100200003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6636483 (or 6636480 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 9.
Adding to 20010100200003 its reverse (30000200101002), we get a palindrome (50010300301005).
Subtracting 20010100200003 from its reverse (30000200101002), we obtain a palindrome (9990099900999).
The spelling of 20010100200003 in words is "twenty trillion, ten billion, one hundred million, two hundred thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •