Base | Representation |
---|---|
bin | 100101100011111110100… |
… | …0110111010100001011001 |
3 | 200021112022122121201100111 |
4 | 1023013331012322201121 |
5 | 1134040301023430323 |
6 | 14551342030004321 |
7 | 1041656421264526 |
oct | 113077506724131 |
9 | 20245278551314 |
10 | 5162502170713 |
11 | 171044a9865a8 |
12 | 6b463b6466a1 |
13 | 2b5a8b840374 |
14 | 13bc1b71414d |
15 | 8e44dbb7c0d |
hex | 4b1fd1ba859 |
5162502170713 has 2 divisors, whose sum is σ = 5162502170714. Its totient is φ = 5162502170712.
The previous prime is 5162502170611. The next prime is 5162502170723. The reversal of 5162502170713 is 3170712052615.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5038624217344 + 123877953369 = 2244688^2 + 351963^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5162502170713 is a prime.
It is a super-3 number, since 3×51625021707133 (a number of 39 digits) contains 333 as substring.
It is not a weakly prime, because it can be changed into another prime (5162502170723) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2581251085356 + 2581251085357.
It is an arithmetic number, because the mean of its divisors is an integer number (2581251085357).
Almost surely, 25162502170713 is an apocalyptic number.
It is an amenable number.
5162502170713 is a deficient number, since it is larger than the sum of its proper divisors (1).
5162502170713 is an equidigital number, since it uses as much as digits as its factorization.
5162502170713 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 88200, while the sum is 40.
The spelling of 5162502170713 in words is "five trillion, one hundred sixty-two billion, five hundred two million, one hundred seventy thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.140 sec. • engine limits •