Base | Representation |
---|---|
bin | 110110100111111011… |
… | …1001111111001000001 |
3 | 102012210010011121212000 |
4 | 1231033313033321001 |
5 | 3410214311000230 |
6 | 125515543454213 |
7 | 11321621356200 |
oct | 1551767177101 |
9 | 365703147760 |
10 | 117304000065 |
11 | 458260604aa |
12 | 1a898a57369 |
13 | b0a57a1535 |
14 | 596b275237 |
15 | 30b8460b60 |
hex | 1b4fdcfe41 |
117304000065 has 192 divisors, whose sum is σ = 247027968000. Its totient is φ = 52649896320.
The previous prime is 117304000039. The next prime is 117304000081. The reversal of 117304000065 is 560000403711.
It is not a de Polignac number, because 117304000065 - 26 = 117304000001 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 178002706 + ... + 178003364.
It is an arithmetic number, because the mean of its divisors is an integer number (1286604000).
Almost surely, 2117304000065 is an apocalyptic number.
117304000065 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
117304000065 is an abundant number, since it is smaller than the sum of its proper divisors (129723967935).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117304000065 is a wasteful number, since it uses less digits than its factorization.
117304000065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1137 (or 1124 counting only the distinct ones).
The product of its (nonzero) digits is 2520, while the sum is 27.
Adding to 117304000065 its reverse (560000403711), we get a palindrome (677304403776).
The spelling of 117304000065 in words is "one hundred seventeen billion, three hundred four million, sixty-five", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •