Base | Representation |
---|---|
bin | 11010100111101100111100… |
… | …001011011100100001101100 |
3 | 120100112111112220000001222020 |
4 | 122213230330023130201230 |
5 | 110321144231411430202 |
6 | 1053000401023350140 |
7 | 33442400110652265 |
oct | 3247547413344154 |
9 | 510474486001866 |
10 | 117077523155052 |
11 | 34339331686319 |
12 | 1116a4a9752350 |
13 | 504349484b965 |
14 | 20ca821dab96c |
15 | d806c5c2a5bc |
hex | 6a7b3c2dc86c |
117077523155052 has 48 divisors (see below), whose sum is σ = 276685798287360. Its totient is φ = 38525307080832.
The previous prime is 117077523155003. The next prime is 117077523155063. The reversal of 117077523155052 is 250551325770711.
It is a super-3 number, since 3×1170775231550523 (a number of 43 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 117077523154986 and 117077523155004.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4881028 + ... + 16061739.
It is an arithmetic number, because the mean of its divisors is an integer number (5764287464320).
Almost surely, 2117077523155052 is an apocalyptic number.
117077523155052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
117077523155052 is an abundant number, since it is smaller than the sum of its proper divisors (159608275132308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117077523155052 is a wasteful number, since it uses less digits than its factorization.
117077523155052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20948750 (or 20948748 counting only the distinct ones).
The product of its (nonzero) digits is 2572500, while the sum is 51.
The spelling of 117077523155052 in words is "one hundred seventeen trillion, seventy-seven billion, five hundred twenty-three million, one hundred fifty-five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •