Base | Representation |
---|---|
bin | 1111000001011011110… |
… | …10111101010000101001 |
3 | 1211100022112100021122222 |
4 | 13200231322331100221 |
5 | 31424102111134023 |
6 | 1033042411323425 |
7 | 52202041622441 |
oct | 7405572752051 |
9 | 1740275307588 |
10 | 516166505513 |
11 | 1899a559935a |
12 | 84053150575 |
13 | 3989c561879 |
14 | 1ada8339121 |
15 | d660068cc8 |
hex | 782debd429 |
516166505513 has 2 divisors, whose sum is σ = 516166505514. Its totient is φ = 516166505512.
The previous prime is 516166505507. The next prime is 516166505527. The reversal of 516166505513 is 315505661615.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 312762799504 + 203403706009 = 559252^2 + 451003^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-516166505513 is a prime.
It is a super-2 number, since 2×5161665055132 (a number of 24 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (516166505213) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 258083252756 + 258083252757.
It is an arithmetic number, because the mean of its divisors is an integer number (258083252757).
Almost surely, 2516166505513 is an apocalyptic number.
It is an amenable number.
516166505513 is a deficient number, since it is larger than the sum of its proper divisors (1).
516166505513 is an equidigital number, since it uses as much as digits as its factorization.
516166505513 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 405000, while the sum is 44.
The spelling of 516166505513 in words is "five hundred sixteen billion, one hundred sixty-six million, five hundred five thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •