Base | Representation |
---|---|
bin | 11010011111100001110000… |
… | …000110100100001010010001 |
3 | 120021112210112012102120120200 |
4 | 122133201300012210022101 |
5 | 110232443230403400212 |
6 | 1051450333115525413 |
7 | 33353661664215564 |
oct | 3237416006441221 |
9 | 507483465376520 |
10 | 116515753575057 |
11 | 34142065374161 |
12 | 1109964a159869 |
13 | 5002508474b65 |
14 | 20ab56d29a4db |
15 | d70c973496dc |
hex | 69f8701a4291 |
116515753575057 has 12 divisors (see below), whose sum is σ = 168301855607184. Its totient is φ = 77676558589080.
The previous prime is 116515753574999. The next prime is 116515753575097. The reversal of 116515753575057 is 750575357515611.
116515753575057 is a `hidden beast` number, since 1 + 1 + 6 + 5 + 1 + 5 + 7 + 5 + 3 + 575 + 0 + 57 = 666.
It is not a de Polignac number, because 116515753575057 - 26 = 116515753574993 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 116515753574985 and 116515753575003.
It is not an unprimeable number, because it can be changed into a prime (116515753575097) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 49661419 + ... + 51954672.
It is an arithmetic number, because the mean of its divisors is an integer number (14025154633932).
Almost surely, 2116515753575057 is an apocalyptic number.
It is an amenable number.
116515753575057 is a deficient number, since it is larger than the sum of its proper divisors (51786102032127).
116515753575057 is a wasteful number, since it uses less digits than its factorization.
116515753575057 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 101743500 (or 101743497 counting only the distinct ones).
The product of its (nonzero) digits is 96468750, while the sum is 63.
The spelling of 116515753575057 in words is "one hundred sixteen trillion, five hundred fifteen billion, seven hundred fifty-three million, five hundred seventy-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •