Base | Representation |
---|---|
bin | 11001101110001101001101… |
… | …001000100100111011101000 |
3 | 112211112210002221122212220220 |
4 | 121232031031020210323220 |
5 | 104311430421023002100 |
6 | 1040333322410050040 |
7 | 32554054404520632 |
oct | 3156151510447350 |
9 | 484483087585826 |
10 | 113126437703400 |
11 | 3305571a979920 |
12 | 108307b3119920 |
13 | 4b17a14967174 |
14 | 1dd14c5169a52 |
15 | d12a291a4aa0 |
hex | 66e34d224ee8 |
113126437703400 has 192 divisors, whose sum is σ = 391904094657600. Its totient is φ = 26755698432000.
The previous prime is 113126437703311. The next prime is 113126437703413. The reversal of 113126437703400 is 4307734621311.
It is a super-2 number, since 2×1131264377034002 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 208758295 + ... + 209299494.
It is an arithmetic number, because the mean of its divisors is an integer number (2041167159675).
Almost surely, 2113126437703400 is an apocalyptic number.
113126437703400 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113126437703400 is an abundant number, since it is smaller than the sum of its proper divisors (278777656954200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113126437703400 is a wasteful number, since it uses less digits than its factorization.
113126437703400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 418057860 (or 418057851 counting only the distinct ones).
The product of its (nonzero) digits is 254016, while the sum is 42.
The spelling of 113126437703400 in words is "one hundred thirteen trillion, one hundred twenty-six billion, four hundred thirty-seven million, seven hundred three thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •