Base | Representation |
---|---|
bin | 110100111000000101… |
… | …1011110001101010000 |
3 | 101212002120121220002121 |
4 | 1221300023132031100 |
5 | 3330023102031300 |
6 | 124055324224024 |
7 | 11126622214246 |
oct | 1516013361520 |
9 | 355076556077 |
10 | 113551205200 |
11 | 4417a771144 |
12 | 1a01009b014 |
13 | a928154364 |
14 | 56d2ab0796 |
15 | 2e48c6b81a |
hex | 1a702de350 |
113551205200 has 60 divisors (see below), whose sum is σ = 282213929340. Its totient is φ = 43854254080.
The previous prime is 113551205189. The next prime is 113551205249. The reversal of 113551205200 is 2502155311.
It can be written as a sum of positive squares in 6 ways, for example, as 5906844736 + 107644360464 = 76856^2 + 328092^2 .
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 4882849 + ... + 4906048.
It is an arithmetic number, because the mean of its divisors is an integer number (4703565489).
Almost surely, 2113551205200 is an apocalyptic number.
113551205200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113551205200 is an abundant number, since it is smaller than the sum of its proper divisors (168662724140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113551205200 is a wasteful number, since it uses less digits than its factorization.
113551205200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9788944 (or 9788933 counting only the distinct ones).
The product of its (nonzero) digits is 1500, while the sum is 25.
The spelling of 113551205200 in words is "one hundred thirteen billion, five hundred fifty-one million, two hundred five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •