Base | Representation |
---|---|
bin | 110011101111111100… |
… | …0011100111100110100 |
3 | 101121211212021011202220 |
4 | 1213133320130330310 |
5 | 3310043324101322 |
6 | 123015204002340 |
7 | 11012624652231 |
oct | 1473770347464 |
9 | 347755234686 |
10 | 111130300212 |
11 | 43148180418 |
12 | 196553903b0 |
13 | a6307293b9 |
14 | 554336c788 |
15 | 2d5646655c |
hex | 19dfe1cf34 |
111130300212 has 24 divisors (see below), whose sum is σ = 259383837216. Its totient is φ = 37032032928.
The previous prime is 111130300111. The next prime is 111130300223. The reversal of 111130300212 is 212003031111.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 111130300191 and 111130300200.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1384398 + ... + 1462469.
It is an arithmetic number, because the mean of its divisors is an integer number (10807659884).
Almost surely, 2111130300212 is an apocalyptic number.
111130300212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111130300212 is an abundant number, since it is smaller than the sum of its proper divisors (148253537004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111130300212 is a wasteful number, since it uses less digits than its factorization.
111130300212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2850127 (or 2850125 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 111130300212 its reverse (212003031111), we get a palindrome (323133331323).
The spelling of 111130300212 in words is "one hundred eleven billion, one hundred thirty million, three hundred thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •