Base | Representation |
---|---|
bin | 1010000001100100111110… |
… | …1000111110001100011111 |
3 | 1110000201021121200112012210 |
4 | 2200121033220332030133 |
5 | 2421042002342101421 |
6 | 35235312230531503 |
7 | 2215220641022022 |
oct | 240311750761437 |
9 | 43021247615183 |
10 | 11022222222111 |
11 | 356a553106331 |
12 | 12a021bb06b93 |
13 | 61c511310cc9 |
14 | 2a169aa411b9 |
15 | 141aa7581576 |
hex | a064fa3e31f |
11022222222111 has 8 divisors (see below), whose sum is σ = 14802025047040. Its totient is φ = 7295283772632.
The previous prime is 11022222222097. The next prime is 11022222222119. The reversal of 11022222222111 is 11122222222011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11022222222111 - 25 = 11022222222079 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11022222222119) 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, 13216093375 + ... + 13216094208.
It is an arithmetic number, because the mean of its divisors is an integer number (1850253130880).
Almost surely, 211022222222111 is an apocalyptic number.
11022222222111 is a deficient number, since it is larger than the sum of its proper divisors (3779802824929).
11022222222111 is a wasteful number, since it uses less digits than its factorization.
11022222222111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 26432187725.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 11022222222111 its reverse (11122222222011), we get a palindrome (22144444444122).
The spelling of 11022222222111 in words is "eleven trillion, twenty-two billion, two hundred twenty-two million, two hundred twenty-two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •