Base | Representation |
---|---|
bin | 10010101000001001… |
… | …111000001101100011 |
3 | 1220121220110122112100 |
4 | 102220021320031203 |
5 | 311430230443021 |
6 | 13104403301443 |
7 | 1305433646523 |
oct | 225011701543 |
9 | 56556418470 |
10 | 20001031011 |
11 | 85340736a5 |
12 | 3a6237a883 |
13 | 1b69978cc0 |
14 | d7a4b3683 |
15 | 7c0dc1626 |
hex | 4a8278363 |
20001031011 has 12 divisors (see below), whose sum is σ = 31112715088. Its totient is φ = 12308326704.
The previous prime is 20001031007. The next prime is 20001031013. The reversal of 20001031011 is 11013010002.
It is not a de Polignac number, because 20001031011 - 22 = 20001031007 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 20001030984 and 20001031002.
It is not an unprimeable number, because it can be changed into a prime (20001031013) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 85474375 + ... + 85474608.
Almost surely, 220001031011 is an apocalyptic number.
20001031011 is a deficient number, since it is larger than the sum of its proper divisors (11111684077).
20001031011 is a wasteful number, since it uses less digits than its factorization.
20001031011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 170949002 (or 170948999 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 9.
Adding to 20001031011 its reverse (11013010002), we get a palindrome (31014041013).
The spelling of 20001031011 in words is "twenty billion, one million, thirty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •