Base | Representation |
---|---|
bin | 11001010010011101101100… |
… | …101110010110100001000101 |
3 | 112120210112021011221221202020 |
4 | 121102131230232112201011 |
5 | 104034212031032020401 |
6 | 1032313432541233353 |
7 | 32266244223344235 |
oct | 3122355456264105 |
9 | 476715234857666 |
10 | 111220002220101 |
11 | 324901578322a5 |
12 | 10583221862859 |
13 | 4a0a002860458 |
14 | 1d67110b6bcc5 |
15 | ccd14a456d36 |
hex | 65276cb96845 |
111220002220101 has 8 divisors (see below), whose sum is σ = 148297074531264. Its totient is φ = 74144799027840.
The previous prime is 111220002220013. The next prime is 111220002220153. The reversal of 111220002220101 is 101022200022111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111220002220101 - 219 = 111220001695813 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111220002220601) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 467140876 + ... + 467378901.
It is an arithmetic number, because the mean of its divisors is an integer number (18537134316408).
Almost surely, 2111220002220101 is an apocalyptic number.
It is an amenable number.
111220002220101 is a deficient number, since it is larger than the sum of its proper divisors (37077072311163).
111220002220101 is an equidigital number, since it uses as much as digits as its factorization.
111220002220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 934559451.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 111220002220101 its reverse (101022200022111), we get a palindrome (212242202242212).
The spelling of 111220002220101 in words is "one hundred eleven trillion, two hundred twenty billion, two million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •