Base | Representation |
---|---|
bin | 1001011011110100… |
… | …01101100101111001 |
3 | 111002000001220221121 |
4 | 10231322031211321 |
5 | 40333142431131 |
6 | 2154340505241 |
7 | 236343335614 |
oct | 45572154571 |
9 | 14060056847 |
10 | 5065202041 |
11 | 216a1a1299 |
12 | b943ab221 |
13 | 62950a593 |
14 | 3609d517b |
15 | 1e9a35911 |
hex | 12de8d979 |
5065202041 has 2 divisors, whose sum is σ = 5065202042. Its totient is φ = 5065202040.
The previous prime is 5065202027. The next prime is 5065202053. The reversal of 5065202041 is 1402025605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4828165225 + 237036816 = 69485^2 + 15396^2 .
It is a cyclic number.
It is not a de Polignac number, because 5065202041 - 227 = 4930984313 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5065201997 and 5065202015.
It is not a weakly prime, because it can be changed into another prime (5065202081) 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, 2532601020 + 2532601021.
It is an arithmetic number, because the mean of its divisors is an integer number (2532601021).
Almost surely, 25065202041 is an apocalyptic number.
It is an amenable number.
5065202041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5065202041 is an equidigital number, since it uses as much as digits as its factorization.
5065202041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2400, while the sum is 25.
The square root of 5065202041 is about 71170.2328294632. The cubic root of 5065202041 is about 1717.3767973792.
Adding to 5065202041 its reverse (1402025605), we get a palindrome (6467227646).
The spelling of 5065202041 in words is "five billion, sixty-five million, two hundred two thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •