Base | Representation |
---|---|
bin | 1101011111001… |
… | …00001111010100 |
3 | 21212212201121121 |
4 | 12233210033110 |
5 | 212430220000 |
6 | 15120453324 |
7 | 2542416235 |
oct | 657441724 |
9 | 255781547 |
10 | 113132500 |
11 | 58951138 |
12 | 31a7a244 |
13 | 1a591110 |
14 | 1104d08c |
15 | 9deab1a |
hex | 6be43d4 |
113132500 has 90 divisors (see below), whose sum is σ = 271021058. Its totient is φ = 41064000.
The previous prime is 113132497. The next prime is 113132533. The reversal of 113132500 is 5231311.
It can be written as a sum of positive squares in 5 ways, for example, as 66292164 + 46840336 = 8142^2 + 6844^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 1917471 + ... + 1917529.
Almost surely, 2113132500 is an apocalyptic number.
113132500 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 113132500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (135510529).
113132500 is an abundant number, since it is smaller than the sum of its proper divisors (157888558).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113132500 is an equidigital number, since it uses as much as digits as its factorization.
113132500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 155 (or 79 counting only the distinct ones).
The product of its (nonzero) digits is 90, while the sum is 16.
The square root of 113132500 is about 10636.3762626188. The cubic root of 113132500 is about 483.6477014175.
Adding to 113132500 its reverse (5231311), we get a palindrome (118363811).
The spelling of 113132500 in words is "one hundred thirteen million, one hundred thirty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •