Base | Representation |
---|---|
bin | 1001000110010111100010… |
… | …00000100001010001011111 |
3 | 2121211221022101022112120100 |
4 | 10203023301000201101133 |
5 | 10110320440241010421 |
6 | 110320245000352143 |
7 | 4133450324036205 |
oct | 443136100412137 |
9 | 77757271275510 |
10 | 20010001110111 |
11 | 6415214a700a1 |
12 | 22b20a4a75653 |
13 | b21c2029c57c |
14 | 4d26bc5cd075 |
15 | 24a78cdb2c26 |
hex | 1232f102145f |
20010001110111 has 12 divisors (see below), whose sum is σ = 28903391108800. Its totient is φ = 13339974814560.
The previous prime is 20010001110109. The next prime is 20010001110119. The reversal of 20010001110111 is 11101110001002.
It is not a de Polignac number, because 20010001110111 - 21 = 20010001110109 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20010001110093 and 20010001110102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20010001110119) 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 11 ways as a sum of consecutive naturals, for example, 3511506 + ... + 7235376.
Almost surely, 220010001110111 is an apocalyptic number.
20010001110111 is a deficient number, since it is larger than the sum of its proper divisors (8893389998689).
20010001110111 is a wasteful number, since it uses less digits than its factorization.
20010001110111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4320926 (or 4320923 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 20010001110111 its reverse (11101110001002), we get a palindrome (31111111111113).
The spelling of 20010001110111 in words is "twenty trillion, ten billion, one million, one hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •