Base | Representation |
---|---|
bin | 111010101101100111000110… |
… | …0111010001111011000111101 |
3 | 2111201120101101001211100100111 |
4 | 1311123032030322033120331 |
5 | 1020142341423330304212 |
6 | 5030214122204030021 |
7 | 213531466042501156 |
oct | 16533161472173075 |
9 | 2451511331740314 |
10 | 516442116650557 |
11 | 13a61096525a559 |
12 | 49b09b37b32311 |
13 | 19222389c3a426 |
14 | 9175d08c8a92d |
15 | 3ea8ca090eea7 |
hex | 1d5b38ce8f63d |
516442116650557 has 2 divisors, whose sum is σ = 516442116650558. Its totient is φ = 516442116650556.
The previous prime is 516442116650527. The next prime is 516442116650563. The reversal of 516442116650557 is 755056611244615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 415547042670841 + 100895073979716 = 20384971^2 + 10044654^2 .
It is a cyclic number.
It is not a de Polignac number, because 516442116650557 - 239 = 515892360836669 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (516442116650527) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 258221058325278 + 258221058325279.
It is an arithmetic number, because the mean of its divisors is an integer number (258221058325279).
Almost surely, 2516442116650557 is an apocalyptic number.
It is an amenable number.
516442116650557 is a deficient number, since it is larger than the sum of its proper divisors (1).
516442116650557 is an equidigital number, since it uses as much as digits as its factorization.
516442116650557 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30240000, while the sum is 58.
The spelling of 516442116650557 in words is "five hundred sixteen trillion, four hundred forty-two billion, one hundred sixteen million, six hundred fifty thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.427 sec. • engine limits •