Base | Representation |
---|---|
bin | 1101100010010… |
… | …11101010110110 |
3 | 21220200020202100 |
4 | 12301023222312 |
5 | 213032244100 |
6 | 15133522530 |
7 | 2546132331 |
oct | 661135266 |
9 | 256606670 |
10 | 113556150 |
11 | 59110464 |
12 | 32043446 |
13 | 1a6abbb6 |
14 | 1111d618 |
15 | 9e81400 |
hex | 6c4bab6 |
113556150 has 72 divisors (see below), whose sum is σ = 306525024. Its totient is φ = 30139200.
The previous prime is 113556143. The next prime is 113556151. The reversal of 113556150 is 51655311.
113556150 is a `hidden beast` number, since 11 + 35 + 5 + 615 + 0 = 666.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113556151) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 124195 + ... + 125105.
It is an arithmetic number, because the mean of its divisors is an integer number (4257292).
Almost surely, 2113556150 is an apocalyptic number.
113556150 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 113556150, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153262512).
113556150 is an abundant number, since it is smaller than the sum of its proper divisors (192968874).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113556150 is a wasteful number, since it uses less digits than its factorization.
113556150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1206 (or 1198 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 27.
The square root of 113556150 is about 10656.2728005621. The cubic root of 113556150 is about 484.2506584756.
The spelling of 113556150 in words is "one hundred thirteen million, five hundred fifty-six thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •