Base | Representation |
---|---|
bin | 10010101110101010… |
… | …110010000110011111 |
3 | 1220220112010002212211 |
4 | 102232222302012133 |
5 | 312141220220111 |
6 | 13123305541251 |
7 | 1311231620434 |
oct | 225652620637 |
9 | 56815102784 |
10 | 20110320031 |
11 | 858a82a0aa |
12 | 3a92aa4827 |
13 | 1b864c2869 |
14 | d8ac01b8b |
15 | 7ca7ad521 |
hex | 4aeab219f |
20110320031 has 16 divisors (see below), whose sum is σ = 21356301568. Its totient is φ = 18903456000.
The previous prime is 20110319987. The next prime is 20110320073. The reversal of 20110320031 is 13002301102.
It is a cyclic number.
It is not a de Polignac number, because 20110320031 - 29 = 20110319519 is a prime.
It is a super-2 number, since 2×201103200312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20110319993 and 20110320020.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110320091) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 674761 + ... + 703933.
It is an arithmetic number, because the mean of its divisors is an integer number (1334768848).
Almost surely, 220110320031 is an apocalyptic number.
20110320031 is a deficient number, since it is larger than the sum of its proper divisors (1245981537).
20110320031 is a wasteful number, since it uses less digits than its factorization.
20110320031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29842.
The product of its (nonzero) digits is 36, while the sum is 13.
Adding to 20110320031 its reverse (13002301102), we get a palindrome (33112621133).
The spelling of 20110320031 in words is "twenty billion, one hundred ten million, three hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •