Base | Representation |
---|---|
bin | 1101011110111… |
… | …01100110010100 |
3 | 21212211100022012 |
4 | 12233131212110 |
5 | 212423332200 |
6 | 15120123352 |
7 | 2542244030 |
oct | 657354624 |
9 | 255740265 |
10 | 113105300 |
11 | 58932760 |
12 | 31a66558 |
13 | 1a581919 |
14 | 110431c0 |
15 | 9de2a35 |
hex | 6bdd994 |
113105300 has 144 divisors (see below), whose sum is σ = 315063168. Its totient is φ = 34214400.
The previous prime is 113105299. The next prime is 113105303. The reversal of 113105300 is 3501311.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113105303) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 284702 + ... + 285098.
Almost surely, 2113105300 is an apocalyptic number.
113105300 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 113105300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157531584).
113105300 is an abundant number, since it is smaller than the sum of its proper divisors (201957868).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113105300 is a wasteful number, since it uses less digits than its factorization.
113105300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 466 (or 459 counting only the distinct ones).
The product of its (nonzero) digits is 45, while the sum is 14.
The square root of 113105300 is about 10635.0975547947. The cubic root of 113105300 is about 483.6089378087.
Adding to 113105300 its reverse (3501311), we get a palindrome (116606611).
The spelling of 113105300 in words is "one hundred thirteen million, one hundred five thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •