Base | Representation |
---|---|
bin | 11101101011111001100… |
… | …11110010111110111111 |
3 | 10121111210122012202201102 |
4 | 32311330303302332333 |
5 | 113202430301431421 |
6 | 2100325421403315 |
7 | 133456403110433 |
oct | 16657463627677 |
9 | 3544718182642 |
10 | 1020001202111 |
11 | 3636420a60a1 |
12 | 14582440953b |
13 | 75254ca4688 |
14 | 375229629c3 |
15 | 1b7ec66d60b |
hex | ed7ccf2fbf |
1020001202111 has 8 divisors (see below), whose sum is σ = 1035152875824. Its totient is φ = 1004881394880.
The previous prime is 1020001202089. The next prime is 1020001202117. The reversal of 1020001202111 is 1112021000201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1020001202111 - 218 = 1020000939967 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1020001202092 and 1020001202101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1020001202117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 7902125 + ... + 8030166.
It is an arithmetic number, because the mean of its divisors is an integer number (129394109478).
Almost surely, 21020001202111 is an apocalyptic number.
1020001202111 is a deficient number, since it is larger than the sum of its proper divisors (15151673713).
1020001202111 is an equidigital number, since it uses as much as digits as its factorization.
1020001202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15933241.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1020001202111 its reverse (1112021000201), we get a palindrome (2132022202312).
The spelling of 1020001202111 in words is "one trillion, twenty billion, one million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •