Base | Representation |
---|---|
bin | 110110101000000001… |
… | …0001100110101110110 |
3 | 102012210022120111020210 |
4 | 1231100002030311312 |
5 | 3410221024334113 |
6 | 125520125210250 |
7 | 11321654644551 |
oct | 1552002146566 |
9 | 365708514223 |
10 | 117306871158 |
11 | 45827741604 |
12 | 1a899a00986 |
13 | b0a62682c9 |
14 | 596b7c1698 |
15 | 30b882b6c3 |
hex | 1b5008cd76 |
117306871158 has 64 divisors (see below), whose sum is σ = 254557458432. Its totient is φ = 35931287040.
The previous prime is 117306871133. The next prime is 117306871183. The reversal of 117306871158 is 851178603711.
117306871158 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (117306871133) and next prime (117306871183).
It is a super-2 number, since 2×1173068711582 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 486010 + ... + 686162.
It is an arithmetic number, because the mean of its divisors is an integer number (3977460288).
Almost surely, 2117306871158 is an apocalyptic number.
117306871158 is an abundant number, since it is smaller than the sum of its proper divisors (137250587274).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
117306871158 is a wasteful number, since it uses less digits than its factorization.
117306871158 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 200349.
The product of its (nonzero) digits is 282240, while the sum is 48.
The spelling of 117306871158 in words is "one hundred seventeen billion, three hundred six million, eight hundred seventy-one thousand, one hundred fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •