Base | Representation |
---|---|
bin | 1010000110110000000111… |
… | …0101100110001110111010 |
3 | 1110100012201110000120222100 |
4 | 2201230001311212032322 |
5 | 2424021023433102302 |
6 | 35344212442404230 |
7 | 2224515460036545 |
oct | 241540165461672 |
9 | 43305643016870 |
10 | 11111111222202 |
11 | 35a4217689782 |
12 | 12b54a8800676 |
13 | 627a08c00894 |
14 | 2a5ad017985c |
15 | 14405b102d1c |
hex | a1b01d663ba |
11111111222202 has 12 divisors (see below), whose sum is σ = 24074074314810. Its totient is φ = 3703703740728.
The previous prime is 11111111222191. The next prime is 11111111222219. The reversal of 11111111222202 is 20222211111111.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 8073616470921 + 3037494751281 = 2841411^2 + 1742841^2 .
It is a Harshad number since it is a multiple of its sum of digits (18), and also a Moran number because the ratio is a prime number: 617283956789 = 11111111222202 / (1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 2 + 2 + 2 + 2 + 0 + 2).
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 308641978377 + ... + 308641978412.
Almost surely, 211111111222202 is an apocalyptic number.
11111111222202 is an abundant number, since it is smaller than the sum of its proper divisors (12962963092608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11111111222202 is a wasteful number, since it uses less digits than its factorization.
11111111222202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 617283956797 (or 617283956794 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 11111111222202 its reverse (20222211111111), we get a palindrome (31333322333313).
The spelling of 11111111222202 in words is "eleven trillion, one hundred eleven billion, one hundred eleven million, two hundred twenty-two thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •