Base | Representation |
---|---|
bin | 11001010000101110001001… |
… | …001001111010001110011011 |
3 | 112120101002002100210220110220 |
4 | 121100232021021322032123 |
5 | 104030231222322401021 |
6 | 1032142423031211123 |
7 | 32254504011326331 |
oct | 3120561111721633 |
9 | 476332070726426 |
10 | 111100220122011 |
11 | 3244437a9780aa |
12 | 10563b72b16aa3 |
13 | 49cb92385a833 |
14 | 1d613ca747b51 |
15 | cc9e89694cc6 |
hex | 650b8927a39b |
111100220122011 has 16 divisors (see below), whose sum is σ = 148491617065728. Its totient is φ = 73887832821600.
The previous prime is 111100220121991. The next prime is 111100220122049. The reversal of 111100220122011 is 110221022001111.
It is a happy number.
It is not a de Polignac number, because 111100220122011 - 217 = 111100219990939 is a prime.
It is a super-2 number, since 2×1111002201220112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (111100220122081) 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 15 ways as a sum of consecutive naturals, for example, 29002600 + ... + 32609066.
It is an arithmetic number, because the mean of its divisors is an integer number (9280726066608).
Almost surely, 2111100220122011 is an apocalyptic number.
111100220122011 is a deficient number, since it is larger than the sum of its proper divisors (37391396943717).
111100220122011 is a wasteful number, since it uses less digits than its factorization.
111100220122011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3631282.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 111100220122011 its reverse (110221022001111), we get a palindrome (221321242123122).
The spelling of 111100220122011 in words is "one hundred eleven trillion, one hundred billion, two hundred twenty million, one hundred twenty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •