Base | Representation |
---|---|
bin | 1110110110111010000… |
… | …10110101101111000101 |
3 | 1210210201122101021111222 |
4 | 13123131002311233011 |
5 | 31331013222300203 |
6 | 1030305512410125 |
7 | 51612012632642 |
oct | 7333502655705 |
9 | 1723648337458 |
10 | 510514650053 |
11 | 187565235731 |
12 | 82b363a6945 |
13 | 391ab64c5b5 |
14 | 1a9cd872dc9 |
15 | d42dca0038 |
hex | 76dd0b5bc5 |
510514650053 has 2 divisors, whose sum is σ = 510514650054. Its totient is φ = 510514650052.
The previous prime is 510514650043. The next prime is 510514650073. The reversal of 510514650053 is 350056415015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 427718616004 + 82796034049 = 654002^2 + 287743^2 .
It is a cyclic number.
It is not a de Polignac number, because 510514650053 - 28 = 510514649797 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 510514649995 and 510514650022.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (510514650043) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 255257325026 + 255257325027.
It is an arithmetic number, because the mean of its divisors is an integer number (255257325027).
Almost surely, 2510514650053 is an apocalyptic number.
It is an amenable number.
510514650053 is a deficient number, since it is larger than the sum of its proper divisors (1).
510514650053 is an equidigital number, since it uses as much as digits as its factorization.
510514650053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 45000, while the sum is 35.
The spelling of 510514650053 in words is "five hundred ten billion, five hundred fourteen million, six hundred fifty thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •