Base | Representation |
---|---|
bin | 11001101100111110111110… |
… | …101000011001101000010000 |
3 | 112211020202022011220201201222 |
4 | 121230332332220121220100 |
5 | 104304041410241301300 |
6 | 1040230551533544212 |
7 | 32545022051344316 |
oct | 3154767650315020 |
9 | 484222264821658 |
10 | 113042442525200 |
11 | 33023037882281 |
12 | 10818471345068 |
13 | 4b0cb19c0b5a6 |
14 | 1dcb3d79740b6 |
15 | d107600b4785 |
hex | 66cfbea19a10 |
113042442525200 has 60 divisors (see below), whose sum is σ = 277362861152640. Its totient is φ = 44254913662080.
The previous prime is 113042442525161. The next prime is 113042442525223. The reversal of 113042442525200 is 2525244240311.
It is a super-3 number, since 3×1130424425252003 (a number of 43 digits) contains 333 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 3006429140 + ... + 3006466739.
It is an arithmetic number, because the mean of its divisors is an integer number (4622714352544).
Almost surely, 2113042442525200 is an apocalyptic number.
113042442525200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113042442525200 is an abundant number, since it is smaller than the sum of its proper divisors (164320418627440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113042442525200 is a wasteful number, since it uses less digits than its factorization.
113042442525200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6012895944 (or 6012895933 counting only the distinct ones).
The product of its (nonzero) digits is 76800, while the sum is 35.
Adding to 113042442525200 its reverse (2525244240311), we get a palindrome (115567686765511).
The spelling of 113042442525200 in words is "one hundred thirteen trillion, forty-two billion, four hundred forty-two million, five hundred twenty-five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •