Base | Representation |
---|---|
bin | 10010101111111010… |
… | …001000001111101001 |
3 | 1220221222020212012221 |
4 | 102233322020033221 |
5 | 312212031320410 |
6 | 13125331434041 |
7 | 1311603461155 |
oct | 225772101751 |
9 | 56858225187 |
10 | 20131120105 |
11 | 85a0546548 |
12 | 3a99a55921 |
13 | 1b8a8c61b5 |
14 | d8d898065 |
15 | 7cc51b4da |
hex | 4afe883e9 |
20131120105 has 8 divisors (see below), whose sum is σ = 24174845064. Its totient is φ = 16093228800.
The previous prime is 20131120049. The next prime is 20131120111. The reversal of 20131120105 is 50102113102.
It can be written as a sum of positive squares in 4 ways, for example, as 1049565609 + 19081554496 = 32397^2 + 138136^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-20131120105 is a prime.
It is a super-2 number, since 2×201311201052 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1450816 + ... + 1464625.
It is an arithmetic number, because the mean of its divisors is an integer number (3021855633).
Almost surely, 220131120105 is an apocalyptic number.
It is an amenable number.
20131120105 is a deficient number, since it is larger than the sum of its proper divisors (4043724959).
20131120105 is a wasteful number, since it uses less digits than its factorization.
20131120105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2916827.
The product of its (nonzero) digits is 60, while the sum is 16.
Adding to 20131120105 its reverse (50102113102), we get a palindrome (70233233207).
The spelling of 20131120105 in words is "twenty billion, one hundred thirty-one million, one hundred twenty thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •