Base | Representation |
---|---|
bin | 11010101010000101101111… |
… | …001001011101101011010100 |
3 | 120101010012000210010111101112 |
4 | 122222011233021131223110 |
5 | 110331341232234440430 |
6 | 1053204012545514152 |
7 | 33460265551620464 |
oct | 3252055711355324 |
9 | 511105023114345 |
10 | 117241587030740 |
11 | 343a1972440427 |
12 | 11196256342958 |
13 | 5055aaca13043 |
14 | 20d4747501ba4 |
15 | d84ac9359195 |
hex | 6aa16f25dad4 |
117241587030740 has 24 divisors (see below), whose sum is σ = 246410306709000. Its totient is φ = 46857973108608.
The previous prime is 117241587030739. The next prime is 117241587030773. The reversal of 117241587030740 is 47030785142711.
It can be written as a sum of positive squares in 4 ways, for example, as 8085856222096 + 109155730808644 = 2843564^2 + 10447762^2 .
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2416331615 + ... + 2416380134.
It is an arithmetic number, because the mean of its divisors is an integer number (10267096112875).
Almost surely, 2117241587030740 is an apocalyptic number.
117241587030740 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
117241587030740 is an abundant number, since it is smaller than the sum of its proper divisors (129168719678260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117241587030740 is a wasteful number, since it uses less digits than its factorization.
117241587030740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4832712971 (or 4832712969 counting only the distinct ones).
The product of its (nonzero) digits is 1317120, while the sum is 50.
The spelling of 117241587030740 in words is "one hundred seventeen trillion, two hundred forty-one billion, five hundred eighty-seven million, thirty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •