Base | Representation |
---|---|
bin | 11001110001111011011011… |
… | …110011110011001101010000 |
3 | 112212110020100212101221210210 |
4 | 121301323123303303031100 |
5 | 104330123304011003300 |
6 | 1041051025054324120 |
7 | 32611411316251344 |
oct | 3161733363631520 |
9 | 485406325357723 |
10 | 113382234469200 |
11 | 33144154542004 |
12 | 108722a0ab9640 |
13 | 4b35b8b974698 |
14 | 1ddda2d7a5624 |
15 | d194ead5e050 |
hex | 671edbcf3350 |
113382234469200 has 120 divisors (see below), whose sum is σ = 363204334961568. Its totient is φ = 30234992483840.
The previous prime is 113382234469181. The next prime is 113382234469223. The reversal of 113382234469200 is 2964432283311.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 113382234469200.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 159116107 + ... + 159827093.
Almost surely, 2113382234469200 is an apocalyptic number.
113382234469200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113382234469200 is an abundant number, since it is smaller than the sum of its proper divisors (249822100492368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113382234469200 is a wasteful number, since it uses less digits than its factorization.
113382234469200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 843901 (or 843890 counting only the distinct ones).
The product of its (nonzero) digits is 1492992, while the sum is 48.
The spelling of 113382234469200 in words is "one hundred thirteen trillion, three hundred eighty-two billion, two hundred thirty-four million, four hundred sixty-nine thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.119 sec. • engine limits •