Base | Representation |
---|---|
bin | 110011110010000100… |
… | …1111101110101011101 |
3 | 101122000212011220200210 |
4 | 1213210021331311131 |
5 | 3310220203001341 |
6 | 123030244443033 |
7 | 11014455256164 |
oct | 1474411756535 |
9 | 348025156623 |
10 | 111202000221 |
11 | 431846a2724 |
12 | 196753a9479 |
13 | a642541940 |
14 | 554cab43db |
15 | 2d5c8cac16 |
hex | 19e427dd5d |
111202000221 has 8 divisors (see below), whose sum is σ = 159674667040. Its totient is φ = 68432000112.
The previous prime is 111202000219. The next prime is 111202000229. The reversal of 111202000221 is 122000202111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 111202000221 - 21 = 111202000219 is a prime.
It is a super-3 number, since 3×1112020002213 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 111202000197 and 111202000206.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111202000229) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1425666631 + ... + 1425666708.
It is an arithmetic number, because the mean of its divisors is an integer number (19959333380).
Almost surely, 2111202000221 is an apocalyptic number.
It is an amenable number.
111202000221 is a deficient number, since it is larger than the sum of its proper divisors (48472666819).
111202000221 is a wasteful number, since it uses less digits than its factorization.
111202000221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2851333355.
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 111202000221 its reverse (122000202111), we get a palindrome (233202202332).
The spelling of 111202000221 in words is "one hundred eleven billion, two hundred two million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •