Base | Representation |
---|---|
bin | 1110110110000011000… |
… | …10001011001010010001 |
3 | 1210202112110220012220222 |
4 | 13123001202023022101 |
5 | 31324042043232400 |
6 | 1030152024042425 |
7 | 51564406556312 |
oct | 7330142131221 |
9 | 1722473805828 |
10 | 510053102225 |
11 | 187348751a47 |
12 | 82a27903415 |
13 | 39136b3b684 |
14 | 1a98844a609 |
15 | d4034d0185 |
hex | 76c188b291 |
510053102225 has 6 divisors (see below), whose sum is σ = 632465846790. Its totient is φ = 408042481760.
The previous prime is 510053102183. The next prime is 510053102227. The reversal of 510053102225 is 522201350015.
It can be written as a sum of positive squares in 3 ways, for example, as 47099416576 + 462953685649 = 217024^2 + 680407^2 .
It is not a de Polignac number, because 510053102225 - 218 = 510052840081 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 510053102194 and 510053102203.
It is not an unprimeable number, because it can be changed into a prime (510053102227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 10201062020 + ... + 10201062069.
It is an arithmetic number, because the mean of its divisors is an integer number (105410974465).
Almost surely, 2510053102225 is an apocalyptic number.
It is an amenable number.
510053102225 is a deficient number, since it is larger than the sum of its proper divisors (122412744565).
510053102225 is a wasteful number, since it uses less digits than its factorization.
510053102225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20402124099 (or 20402124094 counting only the distinct ones).
The product of its (nonzero) digits is 3000, while the sum is 26.
The spelling of 510053102225 in words is "five hundred ten billion, fifty-three million, one hundred two thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •