Base | Representation |
---|---|
bin | 11010011111010100001010… |
… | …000011110001100101000001 |
3 | 120021111101211220202202020220 |
4 | 122133110022003301211001 |
5 | 110232223332101300130 |
6 | 1051435520441253253 |
7 | 33352634160432462 |
oct | 3237241203614501 |
9 | 507441756682226 |
10 | 116501156665665 |
11 | 34136954839082 |
12 | 11096855794229 |
13 | 50010202b0075 |
14 | 20aa986802d69 |
15 | d706e0b09410 |
hex | 69f50a0f1941 |
116501156665665 has 32 divisors (see below), whose sum is σ = 186994374672000. Its totient is φ = 61936734191616.
The previous prime is 116501156665609. The next prime is 116501156665667. The reversal of 116501156665665 is 566566651105611.
It is a happy number.
It is not a de Polignac number, because 116501156665665 - 26 = 116501156665601 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 116501156665599 and 116501156665608.
It is not an unprimeable number, because it can be changed into a prime (116501156665667) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2738752 + ... + 15508161.
It is an arithmetic number, because the mean of its divisors is an integer number (5843574208500).
Almost surely, 2116501156665665 is an apocalyptic number.
116501156665665 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
116501156665665 is a deficient number, since it is larger than the sum of its proper divisors (70493218006335).
116501156665665 is a wasteful number, since it uses less digits than its factorization.
116501156665665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18248273.
The product of its (nonzero) digits is 29160000, while the sum is 60.
The spelling of 116501156665665 in words is "one hundred sixteen trillion, five hundred one billion, one hundred fifty-six million, six hundred sixty-five thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •