Base | Representation |
---|---|
bin | 1101100011001… |
… | …10010110111110 |
3 | 21220212210201020 |
4 | 12301212112332 |
5 | 213044243340 |
6 | 15140125010 |
7 | 2550066132 |
oct | 661462676 |
9 | 256783636 |
10 | 113665470 |
11 | 59185606 |
12 | 32096766 |
13 | 1a719899 |
14 | 1114b3c2 |
15 | 9ea39d0 |
hex | 6c665be |
113665470 has 32 divisors (see below), whose sum is σ = 273162240. Its totient is φ = 30270240.
The previous prime is 113665463. The next prime is 113665477. The reversal of 113665470 is 74566311.
It is an interprime number because it is at equal distance from previous prime (113665463) and next prime (113665477).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113665477) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 25251 + ... + 29409.
It is an arithmetic number, because the mean of its divisors is an integer number (8536320).
Almost surely, 2113665470 is an apocalyptic number.
113665470 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
113665470 is an abundant number, since it is smaller than the sum of its proper divisors (159496770).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
113665470 is a wasteful number, since it uses less digits than its factorization.
113665470 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5080.
The product of its (nonzero) digits is 15120, while the sum is 33.
The square root of 113665470 is about 10661.4009398390. The cubic root of 113665470 is about 484.4060039537.
Adding to 113665470 its sum of digits (33), we get a triangular number (113665503 = T15077).
It can be divided in two parts, 11366 and 5470, that added together give a triangular number (16836 = T183).
The spelling of 113665470 in words is "one hundred thirteen million, six hundred sixty-five thousand, four hundred seventy".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •