Base | Representation |
---|---|
bin | 1001011010010011… |
… | …01000000001011001 |
3 | 111001010002211100021 |
4 | 10231021220001121 |
5 | 40321412341431 |
6 | 2153203510441 |
7 | 236130150235 |
oct | 45511500131 |
9 | 14033084307 |
10 | 5052465241 |
11 | 2162a91a0a |
12 | b90088421 |
13 | 62699b105 |
14 | 35d03b5c5 |
15 | 1e886bb11 |
hex | 12d268059 |
5052465241 has 2 divisors, whose sum is σ = 5052465242. Its totient is φ = 5052465240.
The previous prime is 5052465221. The next prime is 5052465251. The reversal of 5052465241 is 1425642505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4067760841 + 984704400 = 63779^2 + 31380^2 .
It is a cyclic number.
It is not a de Polignac number, because 5052465241 - 213 = 5052457049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5052465197 and 5052465206.
It is not a weakly prime, because it can be changed into another prime (5052465221) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526232620 + 2526232621.
It is an arithmetic number, because the mean of its divisors is an integer number (2526232621).
Almost surely, 25052465241 is an apocalyptic number.
It is an amenable number.
5052465241 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052465241 is an equidigital number, since it uses as much as digits as its factorization.
5052465241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48000, while the sum is 34.
The square root of 5052465241 is about 71080.6952765658. The cubic root of 5052465241 is about 1715.9361016455.
The spelling of 5052465241 in words is "five billion, fifty-two million, four hundred sixty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •