Base | Representation |
---|---|
bin | 1001100010111101… |
… | …11001101110011001 |
3 | 111020011212200100011 |
4 | 10301132321232121 |
5 | 40444014323031 |
6 | 2204321441521 |
7 | 241002033031 |
oct | 46136715631 |
9 | 14204780304 |
10 | 5125151641 |
11 | 21a0018315 |
12 | bb04a02a1 |
13 | 638a6a60c |
14 | 36895c8c1 |
15 | 1eee286b1 |
hex | 1317b9b99 |
5125151641 has 2 divisors, whose sum is σ = 5125151642. Its totient is φ = 5125151640.
The previous prime is 5125151587. The next prime is 5125151657. The reversal of 5125151641 is 1461515215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3681455625 + 1443696016 = 60675^2 + 37996^2 .
It is a cyclic number.
It is not a de Polignac number, because 5125151641 - 219 = 5124627353 is a prime.
It is not a weakly prime, because it can be changed into another prime (5125151441) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2562575820 + 2562575821.
It is an arithmetic number, because the mean of its divisors is an integer number (2562575821).
Almost surely, 25125151641 is an apocalyptic number.
It is an amenable number.
5125151641 is a deficient number, since it is larger than the sum of its proper divisors (1).
5125151641 is an equidigital number, since it uses as much as digits as its factorization.
5125151641 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6000, while the sum is 31.
The square root of 5125151641 is about 71590.1644152323. The cubic root of 5125151641 is about 1724.1256246126.
Adding to 5125151641 its reverse (1461515215), we get a palindrome (6586666856).
The spelling of 5125151641 in words is "five billion, one hundred twenty-five million, one hundred fifty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •