Base | Representation |
---|---|
bin | 1001010100001011… |
… | …01100111010010001 |
3 | 110220112110110101122 |
4 | 10222011230322101 |
5 | 40220240330131 |
6 | 2144131012025 |
7 | 234634456112 |
oct | 45205547221 |
9 | 13815413348 |
10 | 5001105041 |
11 | 2136aa2269 |
12 | b76a3a015 |
13 | 61915786a |
14 | 3562ac209 |
15 | 1e40c3d7b |
hex | 12a16ce91 |
5001105041 has 2 divisors, whose sum is σ = 5001105042. Its totient is φ = 5001105040.
The previous prime is 5001105023. The next prime is 5001105059. The reversal of 5001105041 is 1405011005.
It is a balanced prime because it is at equal distance from previous prime (5001105023) and next prime (5001105059).
It can be written as a sum of positive squares in only one way, i.e., 4992129025 + 8976016 = 70655^2 + 2996^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5001105041 is a prime.
It is a super-2 number, since 2×50011050412 = 50022103262231223362, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5001105091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2500552520 + 2500552521.
It is an arithmetic number, because the mean of its divisors is an integer number (2500552521).
Almost surely, 25001105041 is an apocalyptic number.
It is an amenable number.
5001105041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5001105041 is an equidigital number, since it uses as much as digits as its factorization.
5001105041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100, while the sum is 17.
The square root of 5001105041 is about 70718.4915068188. The cubic root of 5001105041 is about 1710.1019102995.
Adding to 5001105041 its reverse (1405011005), we get a palindrome (6406116046).
The spelling of 5001105041 in words is "five billion, one million, one hundred five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •