Base | Representation |
---|---|
bin | 10010101110101010… |
… | …110000011001000111 |
3 | 1220220112002202021120 |
4 | 102232222300121013 |
5 | 312141220004111 |
6 | 13123305445023 |
7 | 1311231561144 |
oct | 225652603107 |
9 | 56815082246 |
10 | 20110313031 |
11 | 858a824916 |
12 | 3a92aa0773 |
13 | 1b864bc613 |
14 | d8abdd3cb |
15 | 7ca7ab406 |
hex | 4aeab0647 |
20110313031 has 8 divisors (see below), whose sum is σ = 26991325824. Its totient is φ = 13318087800.
The previous prime is 20110313011. The next prime is 20110313033. The reversal of 20110313031 is 13031301102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20110313031 - 222 = 20106118727 is a prime.
It is a super-2 number, since 2×201103130312 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20110313031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110313033) 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, 22196361 + ... + 22197266.
It is an arithmetic number, because the mean of its divisors is an integer number (3373915728).
Almost surely, 220110313031 is an apocalyptic number.
20110313031 is a deficient number, since it is larger than the sum of its proper divisors (6881012793).
20110313031 is a wasteful number, since it uses less digits than its factorization.
20110313031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44393781.
The product of its (nonzero) digits is 54, while the sum is 15.
Adding to 20110313031 its reverse (13031301102), we get a palindrome (33141614133).
The spelling of 20110313031 in words is "twenty billion, one hundred ten million, three hundred thirteen thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •