Base | Representation |
---|---|
bin | 11010100000111111100101… |
… | …111010110110101000111011 |
3 | 120021220102121101211002200000 |
4 | 122200333211322312220323 |
5 | 110241121110200324230 |
6 | 1052004515343244043 |
7 | 33364156640515245 |
oct | 3240774572665073 |
9 | 507812541732600 |
10 | 116616514464315 |
11 | 34180871257658 |
12 | 110b508a8a9623 |
13 | 500bb757c2618 |
14 | 20b23ab3c5095 |
15 | d736e3282b60 |
hex | 6a0fe5eb6a3b |
116616514464315 has 24 divisors (see below), whose sum is σ = 209621784026928. Its totient is φ = 62195474380320.
The previous prime is 116616514464283. The next prime is 116616514464361. The reversal of 116616514464315 is 513464415616611.
116616514464315 is a `hidden beast` number, since 1 + 1 + 6 + 6 + 1 + 65 + 144 + 6 + 431 + 5 = 666.
It is not a de Polignac number, because 116616514464315 - 25 = 116616514464283 is a prime.
It is a super-2 number, since 2×1166165144643152 (a number of 29 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 47990333956 + ... + 47990336385.
It is an arithmetic number, because the mean of its divisors is an integer number (8734241001122).
Almost surely, 2116616514464315 is an apocalyptic number.
116616514464315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
116616514464315 is a deficient number, since it is larger than the sum of its proper divisors (93005269562613).
116616514464315 is an frugal number, since it uses more digits than its factorization.
116616514464315 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 95980670361 (or 95980670349 counting only the distinct ones).
The product of its digits is 6220800, while the sum is 54.
The spelling of 116616514464315 in words is "one hundred sixteen trillion, six hundred sixteen billion, five hundred fourteen million, four hundred sixty-four thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •