Base | Representation |
---|---|
bin | 1001010101010011… |
… | …01000101101110001 |
3 | 110221012012001012112 |
4 | 10222221220231301 |
5 | 40230143300131 |
6 | 2145104535105 |
7 | 235110521504 |
oct | 45251505561 |
9 | 13835161175 |
10 | 5010525041 |
11 | 2141346695 |
12 | b7a021495 |
13 | 61b0a5422 |
14 | 35764113b |
15 | 1e4d3502b |
hex | 12aa68b71 |
5010525041 has 2 divisors, whose sum is σ = 5010525042. Its totient is φ = 5010525040.
The previous prime is 5010525019. The next prime is 5010525061. The reversal of 5010525041 is 1405250105.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4775362816 + 235162225 = 69104^2 + 15335^2 .
It is a cyclic number.
It is not a de Polignac number, because 5010525041 - 218 = 5010262897 is a prime.
It is a super-2 number, since 2×50105250412 = 50210722372976103362, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5010524998 and 5010525016.
It is not a weakly prime, because it can be changed into another prime (5010525061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2505262520 + 2505262521.
It is an arithmetic number, because the mean of its divisors is an integer number (2505262521).
Almost surely, 25010525041 is an apocalyptic number.
It is an amenable number.
5010525041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5010525041 is an equidigital number, since it uses as much as digits as its factorization.
5010525041 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1000, while the sum is 23.
The square root of 5010525041 is about 70785.0622730531. The cubic root of 5010525041 is about 1711.1749435669.
Adding to 5010525041 its reverse (1405250105), we get a palindrome (6415775146).
The spelling of 5010525041 in words is "five billion, ten million, five hundred twenty-five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •