Base | Representation |
---|---|
bin | 1110000000100… |
… | …10001110110110 |
3 | 22012010101112110 |
4 | 13000102032312 |
5 | 220040441230 |
6 | 15354431450 |
7 | 2624601612 |
oct | 700221666 |
9 | 265111473 |
10 | 117515190 |
11 | 603749a1 |
12 | 33432586 |
13 | 1b466c20 |
14 | 11870342 |
15 | a4b44b0 |
hex | 70123b6 |
117515190 has 64 divisors (see below), whose sum is σ = 319737600. Its totient is φ = 27402624.
The previous prime is 117515183. The next prime is 117515201. The reversal of 117515190 is 91515711.
It is a super-2 number, since 2×1175151902 = 27619639761472200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 520 + ... + 15339.
It is an arithmetic number, because the mean of its divisors is an integer number (4995900).
Almost surely, 2117515190 is an apocalyptic number.
117515190 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 117515190, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159868800).
117515190 is an abundant number, since it is smaller than the sum of its proper divisors (202222410).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117515190 is a wasteful number, since it uses less digits than its factorization.
117515190 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15901.
The product of its (nonzero) digits is 1575, while the sum is 30.
The square root of 117515190 is about 10840.4423341485. The cubic root of 117515190 is about 489.8141597079.
The spelling of 117515190 in words is "one hundred seventeen million, five hundred fifteen thousand, one hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •