Base | Representation |
---|---|
bin | 1001110000111101… |
… | …01110010010100101 |
3 | 111112100202220012002 |
4 | 10320132232102211 |
5 | 41214042422232 |
6 | 2224113535045 |
7 | 243625620452 |
oct | 47036562245 |
9 | 14470686162 |
10 | 5242545317 |
11 | 2250309989 |
12 | 1023874485 |
13 | 657191129 |
14 | 37a39a829 |
15 | 20a3b6b62 |
hex | 1387ae4a5 |
5242545317 has 2 divisors, whose sum is σ = 5242545318. Its totient is φ = 5242545316.
The previous prime is 5242545277. The next prime is 5242545331. The reversal of 5242545317 is 7135452425.
5242545317 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5145049441 + 97495876 = 71729^2 + 9874^2 .
It is a cyclic number.
It is not a de Polignac number, because 5242545317 - 212 = 5242541221 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5242545367) 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, 2621272658 + 2621272659.
It is an arithmetic number, because the mean of its divisors is an integer number (2621272659).
Almost surely, 25242545317 is an apocalyptic number.
It is an amenable number.
5242545317 is a deficient number, since it is larger than the sum of its proper divisors (1).
5242545317 is an equidigital number, since it uses as much as digits as its factorization.
5242545317 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 168000, while the sum is 38.
The square root of 5242545317 is about 72405.4232568252. The cubic root of 5242545317 is about 1737.1903081183.
The spelling of 5242545317 in words is "five billion, two hundred forty-two million, five hundred forty-five thousand, three hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •