Base | Representation |
---|---|
bin | 110011110011010101… |
… | …0101110011001111000 |
3 | 101122010210110221121211 |
4 | 1213212222232121320 |
5 | 3310312000022300 |
6 | 123034352012504 |
7 | 11015506415122 |
oct | 1474652563170 |
9 | 348123427554 |
10 | 111244142200 |
11 | 431a6466604 |
12 | 19687531134 |
13 | a64b1a8419 |
14 | 5554524212 |
15 | 2d614524ba |
hex | 19e6aae678 |
111244142200 has 96 divisors (see below), whose sum is σ = 260557542000. Its totient is φ = 44168924160.
The previous prime is 111244142179. The next prime is 111244142203. The reversal of 111244142200 is 2241442111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (111244142203) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 34195774 + ... + 34199026.
Almost surely, 2111244142200 is an apocalyptic number.
111244142200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 111244142200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (130278771000).
111244142200 is an abundant number, since it is smaller than the sum of its proper divisors (149313399800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
111244142200 is a wasteful number, since it uses less digits than its factorization.
111244142200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4481 (or 4472 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 111244142200 its reverse (2241442111), we get a palindrome (113485584311).
The spelling of 111244142200 in words is "one hundred eleven billion, two hundred forty-four million, one hundred forty-two thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •