Base | Representation |
---|---|
bin | 10100101100101011… |
… | …01100011110110011 |
3 | 1001200102120110110221 |
4 | 22112111230132303 |
5 | 140224211013321 |
6 | 5034353033511 |
7 | 542241114553 |
oct | 122625543663 |
9 | 31612513427 |
10 | 11112204211 |
11 | 4792605549 |
12 | 21a1555897 |
13 | 1081252084 |
14 | 775b5b163 |
15 | 450854e41 |
hex | 29656c7b3 |
11112204211 has 4 divisors (see below), whose sum is σ = 11383233624. Its totient is φ = 10841174800.
The previous prime is 11112204209. The next prime is 11112204223. The reversal of 11112204211 is 11240221111.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 11240221111 = 7 ⋅1605745873.
It is a cyclic number.
It is not a de Polignac number, because 11112204211 - 21 = 11112204209 is a prime.
It is a super-2 number, since 2×111122042112 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11112204281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 135514645 + ... + 135514726.
It is an arithmetic number, because the mean of its divisors is an integer number (2845808406).
Almost surely, 211112204211 is an apocalyptic number.
11112204211 is a deficient number, since it is larger than the sum of its proper divisors (271029413).
11112204211 is an equidigital number, since it uses as much as digits as its factorization.
11112204211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 271029412.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11112204211 its reverse (11240221111), we get a palindrome (22352425322).
The spelling of 11112204211 in words is "eleven billion, one hundred twelve million, two hundred four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •