Base | Representation |
---|---|
bin | 110011101111000100… |
… | …1110100110110010000 |
3 | 101121202211200211010010 |
4 | 1213132021310312100 |
5 | 3310013413100422 |
6 | 123012250234520 |
7 | 11012123316645 |
oct | 1473611646620 |
9 | 347684624103 |
10 | 111101300112 |
11 | 431328731a0 |
12 | 19647725a40 |
13 | a62771458a |
14 | 553d57ddcc |
15 | 2d53b38b0c |
hex | 19de274d90 |
111101300112 has 80 divisors (see below), whose sum is σ = 329582833920. Its totient is φ = 31895107200.
The previous prime is 111101300099. The next prime is 111101300119. The reversal of 111101300112 is 211003101111.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is not an unprimeable number, because it can be changed into a prime (111101300119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5527314 + ... + 5547377.
It is an arithmetic number, because the mean of its divisors is an integer number (4119785424).
Almost surely, 2111101300112 is an apocalyptic number.
111101300112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
111101300112 is an abundant number, since it is smaller than the sum of its proper divisors (218481533808).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111101300112 is a wasteful number, since it uses less digits than its factorization.
111101300112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11074732 (or 11074726 counting only the distinct ones).
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 111101300112 its reverse (211003101111), we get a palindrome (322104401223).
The spelling of 111101300112 in words is "one hundred eleven billion, one hundred one million, three hundred thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •