Base | Representation |
---|---|
bin | 10000001010101100111… |
… | …001000100001110001101 |
3 | 10221012200122122120221112 |
4 | 100022230321010032031 |
5 | 121200313030444041 |
6 | 2210215400541405 |
7 | 143160445624124 |
oct | 20125471041615 |
9 | 3835618576845 |
10 | 1111002203021 |
11 | 39919a863a67 |
12 | 15b3a0481865 |
13 | 809c82c4589 |
14 | 3bab678cabb |
15 | 1dd76827deb |
hex | 102ace4438d |
1111002203021 has 16 divisors (see below), whose sum is σ = 1177265760960. Its totient is φ = 1045521509760.
The previous prime is 1111002202931. The next prime is 1111002203057. The reversal of 1111002203021 is 1203022001111.
It is a cyclic number.
It is not a de Polignac number, because 1111002203021 - 210 = 1111002201997 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1111002202987 and 1111002203005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1111002203071) 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 15 ways as a sum of consecutive naturals, for example, 10600145 + ... + 10704441.
It is an arithmetic number, because the mean of its divisors is an integer number (73579110060).
Almost surely, 21111002203021 is an apocalyptic number.
It is an amenable number.
1111002203021 is a deficient number, since it is larger than the sum of its proper divisors (66263557939).
1111002203021 is a wasteful number, since it uses less digits than its factorization.
1111002203021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 108044.
The product of its (nonzero) digits is 24, while the sum is 14.
Adding to 1111002203021 its reverse (1203022001111), we get a palindrome (2314024204132).
The spelling of 1111002203021 in words is "one trillion, one hundred eleven billion, two million, two hundred three thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •