Base | Representation |
---|---|
bin | 1001000110000111010110… |
… | …01011001100110101100111 |
3 | 2121211002212220200200011202 |
4 | 10203003223023030311213 |
5 | 10110200142201441403 |
6 | 110312250530553115 |
7 | 4133022122005064 |
oct | 443035313146547 |
9 | 77732786620152 |
10 | 20001313312103 |
11 | 6411566a27942 |
12 | 22b047b43879b |
13 | b211673ccca6 |
14 | 4d20d6845c6b |
15 | 24a430305688 |
hex | 1230eb2ccd67 |
20001313312103 has 8 divisors (see below), whose sum is σ = 21247170106800. Its totient is φ = 18774772126848.
The previous prime is 20001313312063. The next prime is 20001313312111. The reversal of 20001313312103 is 30121331310002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20001313312103 - 26 = 20001313312039 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001313312133) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 4828900226 + ... + 4828904367.
It is an arithmetic number, because the mean of its divisors is an integer number (2655896263350).
Almost surely, 220001313312103 is an apocalyptic number.
20001313312103 is a deficient number, since it is larger than the sum of its proper divisors (1245856794697).
20001313312103 is a wasteful number, since it uses less digits than its factorization.
20001313312103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9657804721.
The product of its (nonzero) digits is 324, while the sum is 20.
Adding to 20001313312103 its reverse (30121331310002), we get a palindrome (50122644622105).
The spelling of 20001313312103 in words is "twenty trillion, one billion, three hundred thirteen million, three hundred twelve thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •