Base | Representation |
---|---|
bin | 10100111001110001… |
… | …11010100010011010 |
3 | 1001222002100202022212 |
4 | 22130320322202122 |
5 | 140440324200442 |
6 | 5053320315122 |
7 | 545044164032 |
oct | 123470724232 |
9 | 31862322285 |
10 | 11222100122 |
11 | 4839645a12 |
12 | 2212312aa2 |
13 | 109ac4bc3c |
14 | 7865a68c2 |
15 | 45a311a82 |
hex | 29ce3a89a |
11222100122 has 8 divisors (see below), whose sum is σ = 16842171936. Its totient is φ = 5608042812.
The previous prime is 11222100121. The next prime is 11222100151. The reversal of 11222100122 is 22100122211.
11222100122 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×112221001222 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11222100097 and 11222100106.
It is not an unprimeable number, because it can be changed into a prime (11222100121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1498958 + ... + 1506425.
It is an arithmetic number, because the mean of its divisors is an integer number (2105271492).
Almost surely, 211222100122 is an apocalyptic number.
11222100122 is a deficient number, since it is larger than the sum of its proper divisors (5620071814).
11222100122 is a wasteful number, since it uses less digits than its factorization.
11222100122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3007252.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11222100122 its reverse (22100122211), we get a palindrome (33322222333).
The spelling of 11222100122 in words is "eleven billion, two hundred twenty-two million, one hundred thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •