Base | Representation |
---|---|
bin | 1101100000001… |
… | …11001100110100 |
3 | 21220011000001022 |
4 | 12300013030310 |
5 | 212444310300 |
6 | 15123520312 |
7 | 2543553566 |
oct | 660071464 |
9 | 256130038 |
10 | 113275700 |
11 | 58a3978a |
12 | 31b29098 |
13 | 1a611355 |
14 | 11089336 |
15 | 9e28285 |
hex | 6c07334 |
113275700 has 36 divisors (see below), whose sum is σ = 247713312. Its totient is φ = 44959200.
The previous prime is 113275637. The next prime is 113275763. The reversal of 113275700 is 7572311.
It is an interprime number because it is at equal distance from previous prime (113275637) and next prime (113275763).
It is a self number, because there is not a number n which added to its sum of digits gives 113275700.
It is a congruent number.
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, 8777 + ... + 17423.
Almost surely, 2113275700 is an apocalyptic number.
113275700 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 113275700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (123856656).
113275700 is an abundant number, since it is smaller than the sum of its proper divisors (134437612).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113275700 is a wasteful number, since it uses less digits than its factorization.
113275700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8792 (or 8785 counting only the distinct ones).
The product of its (nonzero) digits is 1470, while the sum is 26.
The square root of 113275700 is about 10643.1057497330. The cubic root of 113275700 is about 483.8516780219.
The spelling of 113275700 in words is "one hundred thirteen million, two hundred seventy-five thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •