Base | Representation |
---|---|
bin | 10010101000101110… |
… | …000111100100100111 |
3 | 1220122120100022012220 |
4 | 102220232013210213 |
5 | 311440143443421 |
6 | 13105343043423 |
7 | 1305610464564 |
oct | 225056074447 |
9 | 56576308186 |
10 | 20010531111 |
11 | 853947221a |
12 | 3a655a0573 |
13 | 1b6b92416c |
14 | d7b86786b |
15 | 7c1b4b3c6 |
hex | 4a8b87927 |
20010531111 has 8 divisors (see below), whose sum is σ = 26682950400. Its totient is φ = 13339232952.
The previous prime is 20010531109. The next prime is 20010531113. The reversal of 20010531111 is 11113501002.
It is an interprime number because it is at equal distance from previous prime (20010531109) and next prime (20010531113).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20010531111 - 21 = 20010531109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010531113) 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 in 7 ways as a sum of consecutive naturals, for example, 237711 + ... + 310688.
It is an arithmetic number, because the mean of its divisors is an integer number (3335368800).
Almost surely, 220010531111 is an apocalyptic number.
20010531111 is a deficient number, since it is larger than the sum of its proper divisors (6672419289).
20010531111 is a wasteful number, since it uses less digits than its factorization.
20010531111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 560565.
The product of its (nonzero) digits is 30, while the sum is 15.
The spelling of 20010531111 in words is "twenty billion, ten million, five hundred thirty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.148 sec. • engine limits •