Base | Representation |
---|---|
bin | 1110001001000… |
… | …10100010100000 |
3 | 22021020001112110 |
4 | 13010202202200 |
5 | 220332134220 |
6 | 15434355320 |
7 | 2640225456 |
oct | 704424240 |
9 | 267201473 |
10 | 118630560 |
11 | 60a66994 |
12 | 3388bb40 |
13 | 1b7677c9 |
14 | 11a809d6 |
15 | a634be0 |
hex | 71228a0 |
118630560 has 96 divisors (see below), whose sum is σ = 377540352. Its totient is φ = 31308800.
The previous prime is 118630549. The next prime is 118630591. The reversal of 118630560 is 65036811.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (30).
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, 47257 + ... + 49703.
It is an arithmetic number, because the mean of its divisors is an integer number (3932712).
Almost surely, 2118630560 is an apocalyptic number.
118630560 is a gapful number since it is divisible by the number (10) 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 118630560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (188770176).
118630560 is an abundant number, since it is smaller than the sum of its proper divisors (258909792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
118630560 is a wasteful number, since it uses less digits than its factorization.
118630560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2566 (or 2558 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 30.
The square root of 118630560 is about 10891.7656970759. The cubic root of 118630560 is about 491.3589376986.
The spelling of 118630560 in words is "one hundred eighteen million, six hundred thirty thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •