Base | Representation |
---|---|
bin | 11010100110101110011111… |
… | …101011111101101101111100 |
3 | 120100022002111001120202122022 |
4 | 122212232133223331231330 |
5 | 110314044422111203020 |
6 | 1052505511433135312 |
7 | 33434504414206100 |
oct | 3246563753755574 |
9 | 510262431522568 |
10 | 117010473147260 |
11 | 343129546a9040 |
12 | 111594b685a538 |
13 | 503a06a629a34 |
14 | 20c74a10a1900 |
15 | d7da9e5d1625 |
hex | 6a6b9fafdb7c |
117010473147260 has 144 divisors (see below), whose sum is σ = 316217220738048. Its totient is φ = 35957123395200.
The previous prime is 117010473147247. The next prime is 117010473147307. The reversal of 117010473147260 is 62741374010711.
It is a super-2 number, since 2×1170104731472602 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (44).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 75674084 + ... + 77204843.
It is an arithmetic number, because the mean of its divisors is an integer number (2195952921792).
Almost surely, 2117010473147260 is an apocalyptic number.
117010473147260 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
117010473147260 is an abundant number, since it is smaller than the sum of its proper divisors (199206747590788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117010473147260 is a wasteful number, since it uses less digits than its factorization.
117010473147260 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 152879032 (or 152879023 counting only the distinct ones).
The product of its (nonzero) digits is 197568, while the sum is 44.
The spelling of 117010473147260 in words is "one hundred seventeen trillion, ten billion, four hundred seventy-three million, one hundred forty-seven thousand, two hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •