Base | Representation |
---|---|
bin | 10100101101110000… |
… | …00001010000011010 |
3 | 1001201001111121101212 |
4 | 22112320001100122 |
5 | 140234011432302 |
6 | 5035313543122 |
7 | 542410442015 |
oct | 122670012032 |
9 | 31631447355 |
10 | 11121202202 |
11 | 47976a0900 |
12 | 21a4574aa2 |
13 | 1083082826 |
14 | 77702037c |
15 | 451531052 |
hex | 296e0141a |
11121202202 has 24 divisors (see below), whose sum is σ = 18504462900. Its totient is φ = 5008703040.
The previous prime is 11121202201. The next prime is 11121202207. The reversal of 11121202202 is 20220212111.
11121202202 is digitally balanced in base 5, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 10508095081 + 613107121 = 102509^2 + 24761^2 .
It is a super-2 number, since 2×111212022022 (a number of 21 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11121202201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 184427 + ... + 237182.
Almost surely, 211121202202 is an apocalyptic number.
11121202202 is a deficient number, since it is larger than the sum of its proper divisors (7383260698).
11121202202 is a wasteful number, since it uses less digits than its factorization.
11121202202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 421742 (or 421731 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11121202202 its reverse (20220212111), we get a palindrome (31341414313).
Subtracting 11121202202 from its reverse (20220212111), we obtain a palindrome (9099009909).
The spelling of 11121202202 in words is "eleven billion, one hundred twenty-one million, two hundred two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •