Base | Representation |
---|---|
bin | 110100110001010000… |
… | …1101000011011010000 |
3 | 101211111121120211101110 |
4 | 1221202201220123100 |
5 | 3324040431230300 |
6 | 124020502333320 |
7 | 11121141144663 |
oct | 1514241503320 |
9 | 354447524343 |
10 | 113322133200 |
11 | 44072431a41 |
12 | 19b6742a240 |
13 | a8bc85b5b3 |
14 | 56b04c16da |
15 | 2e33abd550 |
hex | 1a628686d0 |
113322133200 has 240 divisors, whose sum is σ = 382466006720. Its totient is φ = 28602408960.
The previous prime is 113322133189. The next prime is 113322133247. The reversal of 113322133200 is 2331223311.
It is a tau number, because it is divible by the number of its divisors (240).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 40514202 + ... + 40516998.
Almost surely, 2113322133200 is an apocalyptic number.
113322133200 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 113322133200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (191233003360).
113322133200 is an abundant number, since it is smaller than the sum of its proper divisors (269143873520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113322133200 is a wasteful number, since it uses less digits than its factorization.
113322133200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4614 (or 4603 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 113322133200 its reverse (2331223311), we get a palindrome (115653356511).
The spelling of 113322133200 in words is "one hundred thirteen billion, three hundred twenty-two million, one hundred thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •