Base | Representation |
---|---|
bin | 110011110010000011… |
… | …0111111100111111000 |
3 | 101122000210201022221220 |
4 | 1213210012333213320 |
5 | 3310220003033422 |
6 | 123030220032040 |
7 | 11014445532552 |
oct | 1474406774770 |
9 | 348023638856 |
10 | 111201221112 |
11 | 43184210333 |
12 | 19675092620 |
13 | a64232b127 |
14 | 554c9504d2 |
15 | 2d5c7c4e5c |
hex | 19e41bf9f8 |
111201221112 has 32 divisors (see below), whose sum is σ = 292634793600. Its totient is φ = 35116174944.
The previous prime is 111201221099. The next prime is 111201221113. The reversal of 111201221112 is 211122102111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 111201221091 and 111201221100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111201221113) 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, 121930708 + ... + 121931619.
It is an arithmetic number, because the mean of its divisors is an integer number (9144837300).
Almost surely, 2111201221112 is an apocalyptic number.
111201221112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111201221112 is an abundant number, since it is smaller than the sum of its proper divisors (181433572488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111201221112 is a wasteful number, since it uses less digits than its factorization.
111201221112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243862355 (or 243862351 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 111201221112 its reverse (211122102111), we get a palindrome (322323323223).
The spelling of 111201221112 in words is "one hundred eleven billion, two hundred one million, two hundred twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.426 sec. • engine limits •