Base | Representation |
---|---|
bin | 110110101110111011… |
… | …1111000011000000000 |
3 | 102020101111110020111210 |
4 | 1231131313320120000 |
5 | 3411204444000122 |
6 | 125555141410120 |
7 | 11330504262030 |
oct | 1553567703000 |
9 | 366344406453 |
10 | 117539046912 |
11 | 459368006a1 |
12 | 1a943709940 |
13 | b1123a9a01 |
14 | 599057b8c0 |
15 | 30cddde40c |
hex | 1b5ddf8600 |
117539046912 has 160 divisors (see below), whose sum is σ = 373424527872. Its totient is φ = 32122404864.
The previous prime is 117539046851. The next prime is 117539046949. The reversal of 117539046912 is 219640935711.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 9648 + ... + 484944.
Almost surely, 2117539046912 is an apocalyptic number.
117539046912 is a gapful number since it is divisible by the number (12) 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 117539046912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (186712263936).
117539046912 is an abundant number, since it is smaller than the sum of its proper divisors (255885480960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117539046912 is an equidigital number, since it uses as much as digits as its factorization.
117539046912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 475348 (or 475332 counting only the distinct ones).
The product of its (nonzero) digits is 408240, while the sum is 48.
The spelling of 117539046912 in words is "one hundred seventeen billion, five hundred thirty-nine million, forty-six thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •