Base | Representation |
---|---|
bin | 100001010010010… |
… | …0110000001110000 |
3 | 2212211121211221200 |
4 | 1002210212001300 |
5 | 4241410423300 |
6 | 302454451200 |
7 | 36451254510 |
oct | 10244460160 |
9 | 2784554850 |
10 | 1116889200 |
11 | 523500429 |
12 | 272063b00 |
13 | 14a5151ab |
14 | a8497840 |
15 | 680c0200 |
hex | 42926070 |
1116889200 has 720 divisors, whose sum is σ = 4835690496. Its totient is φ = 233164800.
The previous prime is 1116889187. The next prime is 1116889229. The reversal of 1116889200 is 29886111.
It is a tau number, because it is divible by the number of its divisors (720).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 23763577 + ... + 23763623.
Almost surely, 21116889200 is an apocalyptic number.
1116889200 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 1116889200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2417845248).
1116889200 is an abundant number, since it is smaller than the sum of its proper divisors (3718801296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1116889200 is a wasteful number, since it uses less digits than its factorization.
1116889200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 142 (or 128 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 36.
The square root of 1116889200 is about 33419.8922798982. The cubic root of 1116889200 is about 1037.5364520023.
The spelling of 1116889200 in words is "one billion, one hundred sixteen million, eight hundred eighty-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •