Base | Representation |
---|---|
bin | 1001001011111101010111… |
… | …01001100110001000010111 |
3 | 2122112022011211222011021111 |
4 | 10211332223221212020113 |
5 | 10121442410404013421 |
6 | 110544415514155451 |
7 | 4153361100132034 |
oct | 445765351461027 |
9 | 78468154864244 |
10 | 20202111001111 |
11 | 6489737aa0656 |
12 | 232337a122b87 |
13 | b37087a731a0 |
14 | 4dbb0485038b |
15 | 2507837e6ee1 |
hex | 125faba66217 |
20202111001111 has 16 divisors (see below), whose sum is σ = 21862225375200. Its totient is φ = 18557178837120.
The previous prime is 20202111001069. The next prime is 20202111001123. The reversal of 20202111001111 is 11110011120202.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 20202111001111 - 221 = 20202108903959 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20202111001091 and 20202111001100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20202111001211) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 19657221 + ... + 20659393.
It is an arithmetic number, because the mean of its divisors is an integer number (1366389085950).
Almost surely, 220202111001111 is an apocalyptic number.
20202111001111 is a deficient number, since it is larger than the sum of its proper divisors (1660114374089).
20202111001111 is a wasteful number, since it uses less digits than its factorization.
20202111001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1009746.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20202111001111 its reverse (11110011120202), we get a palindrome (31312122121313).
The spelling of 20202111001111 in words is "twenty trillion, two hundred two billion, one hundred eleven million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •