Base | Representation |
---|---|
bin | 1010101100111001… |
… | …10001111101000001 |
3 | 112211101220010222211 |
4 | 11112130301331001 |
5 | 43231302240023 |
6 | 2350034502121 |
7 | 262242455605 |
oct | 52634617501 |
9 | 15741803884 |
10 | 5745352513 |
11 | 248911341a |
12 | 1144134941 |
13 | 7073b9b94 |
14 | 3c7083505 |
15 | 2395d6a0d |
hex | 156731f41 |
5745352513 has 2 divisors, whose sum is σ = 5745352514. Its totient is φ = 5745352512.
The previous prime is 5745352511. The next prime is 5745352523. The reversal of 5745352513 is 3152535475.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3321562689 + 2423789824 = 57633^2 + 49232^2 .
It is a cyclic number.
It is not a de Polignac number, because 5745352513 - 21 = 5745352511 is a prime.
Together with 5745352511, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (5745352511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2872676256 + 2872676257.
It is an arithmetic number, because the mean of its divisors is an integer number (2872676257).
Almost surely, 25745352513 is an apocalyptic number.
It is an amenable number.
5745352513 is a deficient number, since it is larger than the sum of its proper divisors (1).
5745352513 is an equidigital number, since it uses as much as digits as its factorization.
5745352513 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 315000, while the sum is 40.
The square root of 5745352513 is about 75798.1036240353. The cubic root of 5745352513 is about 1791.0411338606.
Adding to 5745352513 its reverse (3152535475), we get a palindrome (8897887988).
The spelling of 5745352513 in words is "five billion, seven hundred forty-five million, three hundred fifty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •