Base | Representation |
---|---|
bin | 10100101101101000… |
… | …01111010001001110 |
3 | 1001200222122020202111 |
4 | 22112310033101032 |
5 | 140233233223042 |
6 | 5035240414234 |
7 | 542366143204 |
oct | 122664172116 |
9 | 31628566674 |
10 | 11120211022 |
11 | 4797084148 |
12 | 21a417737a |
13 | 1082ac662b |
14 | 776c43074 |
15 | 4513d7517 |
hex | 296d0f44e |
11120211022 has 4 divisors (see below), whose sum is σ = 16680316536. Its totient is φ = 5560105510.
The previous prime is 11120211013. The next prime is 11120211023. The reversal of 11120211022 is 22011202111.
11120211022 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 22011202111 = 9323 ⋅2360957.
It is a junction number, because it is equal to n+sod(n) for n = 11120210993 and 11120211011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11120211023) 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 as a sum of consecutive naturals, namely, 2780052754 + ... + 2780052757.
It is an arithmetic number, because the mean of its divisors is an integer number (4170079134).
Almost surely, 211120211022 is an apocalyptic number.
11120211022 is a deficient number, since it is larger than the sum of its proper divisors (5560105514).
11120211022 is an equidigital number, since it uses as much as digits as its factorization.
11120211022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5560105513.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 11120211022 its reverse (22011202111), we get a palindrome (33131413133).
The spelling of 11120211022 in words is "eleven billion, one hundred twenty million, two hundred eleven thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •