Base | Representation |
---|---|
bin | 1101100000100… |
… | …00011100010000 |
3 | 21220012220222020 |
4 | 12300100130100 |
5 | 213002013202 |
6 | 15124411440 |
7 | 2544102132 |
oct | 660203420 |
9 | 256186866 |
10 | 113313552 |
11 | 58a65170 |
12 | 31b46b80 |
13 | 1a625651 |
14 | 11099052 |
15 | 9e345bc |
hex | 6c10710 |
113313552 has 80 divisors (see below), whose sum is σ = 320818752. Its totient is φ = 34178560.
The previous prime is 113313533. The next prime is 113313601. The reversal of 113313552 is 255313311.
It is a super-2 number, since 2×1133135522 = 25679922133713408, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 167038 + ... + 167714.
Almost surely, 2113313552 is an apocalyptic number.
113313552 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 113313552, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (160409376).
113313552 is an abundant number, since it is smaller than the sum of its proper divisors (207505200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113313552 is a wasteful number, since it uses less digits than its factorization.
113313552 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016 (or 1010 counting only the distinct ones).
The product of its digits is 1350, while the sum is 24.
The square root of 113313552 is about 10644.8838415457. The cubic root of 113313552 is about 483.9055663495.
Adding to 113313552 its reverse (255313311), we get a palindrome (368626863).
The spelling of 113313552 in words is "one hundred thirteen million, three hundred thirteen thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •