Base | Representation |
---|---|
bin | 1101100011111… |
… | …01001111000100 |
3 | 21221001120020200 |
4 | 12301331033010 |
5 | 213110243142 |
6 | 15142130500 |
7 | 2550636252 |
oct | 661751704 |
9 | 257046220 |
10 | 113759172 |
11 | 59239a4a |
12 | 32120a30 |
13 | 1a750427 |
14 | 111735d2 |
15 | 9ec164c |
hex | 6c7d3c4 |
113759172 has 72 divisors (see below), whose sum is σ = 306738432. Its totient is φ = 35424000.
The previous prime is 113759161. The next prime is 113759203. The reversal of 113759172 is 271957311.
It is a super-2 number, since 2×1137591722 = 25882298428251168, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 91797 + ... + 93027.
It is an arithmetic number, because the mean of its divisors is an integer number (4260256).
Almost surely, 2113759172 is an apocalyptic number.
113759172 is a gapful number since it is divisible by the number (12) 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 113759172, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153369216).
113759172 is an abundant number, since it is smaller than the sum of its proper divisors (192979260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113759172 is a wasteful number, since it uses less digits than its factorization.
113759172 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1409 (or 1404 counting only the distinct ones).
The product of its digits is 13230, while the sum is 36.
The square root of 113759172 is about 10665.7944851755. The cubic root of 113759172 is about 484.5390767461.
The spelling of 113759172 in words is "one hundred thirteen million, seven hundred fifty-nine thousand, one hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •