Base | Representation |
---|---|
bin | 1010001101001101001101… |
… | …1000100111000010111111 |
3 | 1110201210221112202000222212 |
4 | 2203103103120213002333 |
5 | 2432330124230133434 |
6 | 35511152135531035 |
7 | 2235522434551130 |
oct | 243232330470277 |
9 | 43653845660885 |
10 | 11222001021119 |
11 | 3637251023999 |
12 | 1312a95529a7b |
13 | 6352cb861c05 |
14 | 2ab20d5c1c87 |
15 | 146d9b3ae8ce |
hex | a34d36270bf |
11222001021119 has 32 divisors (see below), whose sum is σ = 13388833142784. Its totient is φ = 9205612416000.
The previous prime is 11222001021103. The next prime is 11222001021157. The reversal of 11222001021119 is 91112010022211.
It is a happy number.
It is not a de Polignac number, because 11222001021119 - 24 = 11222001021103 is a prime.
It is a super-2 number, since 2×112220010211192 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11222001021094 and 11222001021103.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11222001021619) 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 31 ways as a sum of consecutive naturals, for example, 11512367 + ... + 12449039.
It is an arithmetic number, because the mean of its divisors is an integer number (418401035712).
Almost surely, 211222001021119 is an apocalyptic number.
11222001021119 is a deficient number, since it is larger than the sum of its proper divisors (2166832121665).
11222001021119 is an equidigital number, since it uses as much as digits as its factorization.
11222001021119 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 937527.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 11222001021119 in words is "eleven trillion, two hundred twenty-two billion, one million, twenty-one thousand, one hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •