Base | Representation |
---|---|
bin | 1101100010101… |
… | …11001010101000 |
3 | 21220202122100102 |
4 | 12301113022220 |
5 | 213040300430 |
6 | 15134524532 |
7 | 2546416532 |
oct | 661271250 |
9 | 256678312 |
10 | 113603240 |
11 | 59142883 |
12 | 32066748 |
13 | 1a6c746a |
14 | 11132852 |
15 | 9e90345 |
hex | 6c572a8 |
113603240 has 32 divisors (see below), whose sum is σ = 256555080. Its totient is φ = 45272832.
The previous prime is 113603207. The next prime is 113603263. The reversal of 113603240 is 42306311.
It can be written as a sum of positive squares in 4 ways, for example, as 48413764 + 65189476 = 6958^2 + 8074^2 .
It is a super-2 number, since 2×1136032402 = 25811392276995200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5954 + ... + 16206.
Almost surely, 2113603240 is an apocalyptic number.
113603240 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
113603240 is an abundant number, since it is smaller than the sum of its proper divisors (142951840).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113603240 is a wasteful number, since it uses less digits than its factorization.
113603240 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10541 (or 10537 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 113603240 is about 10658.4820682872. The cubic root of 113603240 is about 484.3175863410.
Adding to 113603240 its reverse (42306311), we get a palindrome (155909551).
The spelling of 113603240 in words is "one hundred thirteen million, six hundred three thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •