Base | Representation |
---|---|
bin | 11010011101110001101111… |
… | …000011111010000111100001 |
3 | 120021010022001220212100211100 |
4 | 122131301233003322013201 |
5 | 110224010414104021212 |
6 | 1051315202143505013 |
7 | 33342203266306620 |
oct | 3235615703720741 |
9 | 507108056770740 |
10 | 116395477017057 |
11 | 340a6054396a07 |
12 | 1107a2818b8169 |
13 | 4cc407aba9a04 |
14 | 20a57dd3236b7 |
15 | d6caa7e65bdc |
hex | 69dc6f0fa1e1 |
116395477017057 has 48 divisors (see below), whose sum is σ = 192208167698560. Its totient is φ = 66489809734656.
The previous prime is 116395477016999. The next prime is 116395477017161. The reversal of 116395477017057 is 750710774593611.
It is a happy number.
116395477017057 is a `hidden beast` number, since 1 + 1 + 6 + 3 + 9 + 547 + 70 + 17 + 0 + 5 + 7 = 666.
It is not a de Polignac number, because 116395477017057 - 28 = 116395477016801 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 116395477016985 and 116395477017003.
It is not an unprimeable number, because it can be changed into a prime (116395477017857) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 2839378353 + ... + 2839419345.
Almost surely, 2116395477017057 is an apocalyptic number.
It is an amenable number.
116395477017057 is a deficient number, since it is larger than the sum of its proper divisors (75812690681503).
116395477017057 is a wasteful number, since it uses less digits than its factorization.
116395477017057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 54742 (or 54739 counting only the distinct ones).
The product of its (nonzero) digits is 38896200, while the sum is 63.
The spelling of 116395477017057 in words is "one hundred sixteen trillion, three hundred ninety-five billion, four hundred seventy-seven million, seventeen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •