Base | Representation |
---|---|
bin | 110110101110001100… |
… | …1011000000000000000 |
3 | 102020022202211120202220 |
4 | 1231130121120000000 |
5 | 3411132123212033 |
6 | 125552454411040 |
7 | 11330053560144 |
oct | 1553431300000 |
9 | 366282746686 |
10 | 117514272768 |
11 | 4592381a4a2 |
12 | 1a937360a80 |
13 | b10a214559 |
14 | 598b16d224 |
15 | 30cbb48bb3 |
hex | 1b5c658000 |
117514272768 has 128 divisors (see below), whose sum is σ = 318520022640. Its totient is φ = 38527303680.
The previous prime is 117514272749. The next prime is 117514272809. The reversal of 117514272768 is 867272415711.
It is a tau number, because it is divible by the number of its divisors (128).
It is a self number, because there is not a number n which added to its sum of digits gives 117514272768.
It is a congruent number.
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, 5986746 + ... + 6006342.
Almost surely, 2117514272768 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 117514272768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (159260011320).
117514272768 is an abundant number, since it is smaller than the sum of its proper divisors (201005749872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117514272768 is an frugal number, since it uses more digits than its factorization.
117514272768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19691 (or 19663 counting only the distinct ones).
The product of its digits is 1317120, while the sum is 51.
The spelling of 117514272768 in words is "one hundred seventeen billion, five hundred fourteen million, two hundred seventy-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.466 sec. • engine limits •