Base | Representation |
---|---|
bin | 11001010000101101111101… |
… | …010110100011011101000101 |
3 | 112120101001120120012212002111 |
4 | 121100231331112203131011 |
5 | 104030230321130010041 |
6 | 1032142351235141021 |
7 | 32254466055262030 |
oct | 3120557526433505 |
9 | 476331516185074 |
10 | 111100022110021 |
11 | 3244428912282a |
12 | 10563b18744771 |
13 | 49cb8c181b389 |
14 | 1d613ac322017 |
15 | cc9e770ce981 |
hex | 650b7d5a3745 |
111100022110021 has 16 divisors (see below), whose sum is σ = 127004462491648. Its totient is φ = 95203836615600.
The previous prime is 111100022110019. The next prime is 111100022110037. The reversal of 111100022110021 is 120011220001111.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 111100022110021 - 21 = 111100022110019 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 111100022109983 and 111100022110010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111100022110061) 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, 535289656 + ... + 535497166.
It is an arithmetic number, because the mean of its divisors is an integer number (7937778905728).
Almost surely, 2111100022110021 is an apocalyptic number.
It is an amenable number.
111100022110021 is a deficient number, since it is larger than the sum of its proper divisors (15904440381627).
111100022110021 is a wasteful number, since it uses less digits than its factorization.
111100022110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 227032.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 111100022110021 its reverse (120011220001111), we get a palindrome (231111242111132).
The spelling of 111100022110021 in words is "one hundred eleven trillion, one hundred billion, twenty-two million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •