Base | Representation |
---|---|
bin | 1001100101000111… |
… | …01000111010011001 |
3 | 111021102210010212012 |
4 | 10302203220322121 |
5 | 41013122430323 |
6 | 2210203555305 |
7 | 241311141542 |
oct | 46243507231 |
9 | 14242703765 |
10 | 5143170713 |
11 | 21aa20530a |
12 | bb652bb35 |
13 | 63c7091a5 |
14 | 36b0cd4c9 |
15 | 2017d7678 |
hex | 1328e8e99 |
5143170713 has 2 divisors, whose sum is σ = 5143170714. Its totient is φ = 5143170712.
The previous prime is 5143170671. The next prime is 5143170731. The reversal of 5143170713 is 3170713415.
Together with next prime (5143170731) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4733027209 + 410143504 = 68797^2 + 20252^2 .
It is a cyclic number.
It is not a de Polignac number, because 5143170713 - 218 = 5142908569 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 5143170713.
It is not a weakly prime, because it can be changed into another prime (5143170313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2571585356 + 2571585357.
It is an arithmetic number, because the mean of its divisors is an integer number (2571585357).
Almost surely, 25143170713 is an apocalyptic number.
It is an amenable number.
5143170713 is a deficient number, since it is larger than the sum of its proper divisors (1).
5143170713 is an equidigital number, since it uses as much as digits as its factorization.
5143170713 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8820, while the sum is 32.
The square root of 5143170713 is about 71715.9027901065. The cubic root of 5143170713 is about 1726.1438286996.
The spelling of 5143170713 in words is "five billion, one hundred forty-three million, one hundred seventy thousand, seven hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •