Base | Representation |
---|---|
bin | 10010101110101110… |
… | …100100000100011011 |
3 | 1220220120222110102020 |
4 | 102232232210010123 |
5 | 312141443424011 |
6 | 13123343105523 |
7 | 1311243216102 |
oct | 225656440433 |
9 | 56816873366 |
10 | 20111311131 |
11 | 859034679a |
12 | 3a932a22a3 |
13 | 1b8677ba02 |
14 | d8adbd039 |
15 | 7ca907006 |
hex | 4aeba411b |
20111311131 has 4 divisors (see below), whose sum is σ = 26815081512. Its totient is φ = 13407540752.
The previous prime is 20111311127. The next prime is 20111311133. The reversal of 20111311131 is 13111311102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20111311131 - 22 = 20111311127 is a prime.
It is a super-2 number, since 2×201113111312 (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 20111311131.
It is not an unprimeable number, because it can be changed into a prime (20111311133) 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 3 ways as a sum of consecutive naturals, for example, 3351885186 + ... + 3351885191.
It is an arithmetic number, because the mean of its divisors is an integer number (6703770378).
Almost surely, 220111311131 is an apocalyptic number.
20111311131 is a deficient number, since it is larger than the sum of its proper divisors (6703770381).
20111311131 is an equidigital number, since it uses as much as digits as its factorization.
20111311131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6703770380.
The product of its (nonzero) digits is 18, while the sum is 15.
Adding to 20111311131 its reverse (13111311102), we get a palindrome (33222622233).
The spelling of 20111311131 in words is "twenty billion, one hundred eleven million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •