Base | Representation |
---|---|
bin | 1001001001011101001011… |
… | …01100100001101010011111 |
3 | 2122020002012102020001122110 |
4 | 10210232211230201222133 |
5 | 10114040244102310111 |
6 | 110441114132045103 |
7 | 4144225000502460 |
oct | 444564554415237 |
9 | 78202172201573 |
10 | 20116111760031 |
11 | 64562167319a1 |
12 | 230a779163793 |
13 | b2bc30a79ba1 |
14 | 4d78a7022d67 |
15 | 24d3ed7e05a6 |
hex | 124ba5b21a9f |
20116111760031 has 16 divisors (see below), whose sum is σ = 31305316783104. Its totient is φ = 11250348217824.
The previous prime is 20116111759981. The next prime is 20116111760053. The reversal of 20116111760031 is 13006711161102.
It is not a de Polignac number, because 20116111760031 - 222 = 20116107565727 is a prime.
It is a super-2 number, since 2×201161117600312 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20116111760231) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10190531820 + ... + 10190533793.
It is an arithmetic number, because the mean of its divisors is an integer number (1956582298944).
Almost surely, 220116111760031 is an apocalyptic number.
20116111760031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
20116111760031 is a deficient number, since it is larger than the sum of its proper divisors (11189205023073).
20116111760031 is a wasteful number, since it uses less digits than its factorization.
20116111760031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20381065670.
The product of its (nonzero) digits is 1512, while the sum is 30.
The spelling of 20116111760031 in words is "twenty trillion, one hundred sixteen billion, one hundred eleven million, seven hundred sixty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •