Base | Representation |
---|---|
bin | 1001100010111011… |
… | …10100111110011001 |
3 | 111020011100101001112 |
4 | 10301131310332121 |
5 | 40443431320131 |
6 | 2204311430105 |
7 | 240666451034 |
oct | 46135647631 |
9 | 14204311045 |
10 | 5124870041 |
11 | 219a945795 |
12 | bb0385335 |
13 | 63899c3a5 |
14 | 3688c801b |
15 | 1eedc002b |
hex | 131774f99 |
5124870041 has 2 divisors, whose sum is σ = 5124870042. Its totient is φ = 5124870040.
The previous prime is 5124870017. The next prime is 5124870073. The reversal of 5124870041 is 1400784215.
It is a happy number.
It is an a-pointer prime, because the next prime (5124870073) can be obtained adding 5124870041 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2562485641 + 2562384400 = 50621^2 + 50620^2 .
It is a cyclic number.
It is not a de Polignac number, because 5124870041 - 210 = 5124869017 is a prime.
It is not a weakly prime, because it can be changed into another prime (5124870011) 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, 2562435020 + 2562435021.
It is an arithmetic number, because the mean of its divisors is an integer number (2562435021).
Almost surely, 25124870041 is an apocalyptic number.
5124870041 is the 50621-st centered square number.
It is an amenable number.
5124870041 is a deficient number, since it is larger than the sum of its proper divisors (1).
5124870041 is an equidigital number, since it uses as much as digits as its factorization.
5124870041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8960, while the sum is 32.
The square root of 5124870041 is about 71588.1976375995. The cubic root of 5124870041 is about 1724.0940468368.
The spelling of 5124870041 in words is "five billion, one hundred twenty-four million, eight hundred seventy thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •