Base | Representation |
---|---|
bin | 1001100010100010… |
… | …00001110001100101 |
3 | 111012221000220020211 |
4 | 10301101001301211 |
5 | 40442101431342 |
6 | 2204111455421 |
7 | 240626104303 |
oct | 46121016145 |
9 | 14187026224 |
10 | 5121514597 |
11 | 2198a637a1 |
12 | bab227571 |
13 | 638096014 |
14 | 368293273 |
15 | 1ee95ac17 |
hex | 131441c65 |
5121514597 has 2 divisors, whose sum is σ = 5121514598. Its totient is φ = 5121514596.
The previous prime is 5121514577. The next prime is 5121514667. The reversal of 5121514597 is 7954151215.
5121514597 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4416134116 + 705380481 = 66454^2 + 26559^2 .
It is a cyclic number.
It is not a de Polignac number, because 5121514597 - 227 = 4987296869 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5121514577) 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, 2560757298 + 2560757299.
It is an arithmetic number, because the mean of its divisors is an integer number (2560757299).
Almost surely, 25121514597 is an apocalyptic number.
It is an amenable number.
5121514597 is a deficient number, since it is larger than the sum of its proper divisors (1).
5121514597 is an equidigital number, since it uses as much as digits as its factorization.
5121514597 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 63000, while the sum is 40.
The square root of 5121514597 is about 71564.7580656848. The cubic root of 5121514597 is about 1723.7176884113.
The spelling of 5121514597 in words is "five billion, one hundred twenty-one million, five hundred fourteen thousand, five hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •