Base | Representation |
---|---|
bin | 1010101000110111… |
… | …00000110000010001 |
3 | 112202001010111201212 |
4 | 11110123200300101 |
5 | 43144113343424 |
6 | 2342424305505 |
7 | 261351440612 |
oct | 52433406021 |
9 | 15661114655 |
10 | 5711465489 |
11 | 2470a78614 |
12 | 1134912295 |
13 | 7003838a2 |
14 | 3c2781c09 |
15 | 23664110e |
hex | 1546e0c11 |
5711465489 has 2 divisors, whose sum is σ = 5711465490. Its totient is φ = 5711465488.
The previous prime is 5711465479. The next prime is 5711465491. The reversal of 5711465489 is 9845641175.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4675140625 + 1036324864 = 68375^2 + 32192^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5711465489 is a prime.
Together with 5711465491, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5711465479) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2855732744 + 2855732745.
It is an arithmetic number, because the mean of its divisors is an integer number (2855732745).
Almost surely, 25711465489 is an apocalyptic number.
It is an amenable number.
5711465489 is a deficient number, since it is larger than the sum of its proper divisors (1).
5711465489 is an equidigital number, since it uses as much as digits as its factorization.
5711465489 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1209600, while the sum is 50.
The square root of 5711465489 is about 75574.2382627837. The cubic root of 5711465489 is about 1787.5129040358.
The spelling of 5711465489 in words is "five billion, seven hundred eleven million, four hundred sixty-five thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •