Base | Representation |
---|---|
bin | 1110110110110110100… |
… | …10001011100011100111 |
3 | 1210210122120210212000002 |
4 | 13123123102023203213 |
5 | 31330433142222114 |
6 | 1030302535411515 |
7 | 51611203621133 |
oct | 7333322134347 |
9 | 1723576725002 |
10 | 510485117159 |
11 | 18754a5a4186 |
12 | 82b28523b9b |
13 | 391a54ac104 |
14 | 1a9c99863c3 |
15 | d42b3b97de |
hex | 76db48b8e7 |
510485117159 has 2 divisors, whose sum is σ = 510485117160. Its totient is φ = 510485117158.
The previous prime is 510485117101. The next prime is 510485117161. The reversal of 510485117159 is 951711584015.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 510485117159 - 216 = 510485051623 is a prime.
Together with 510485117161, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (510485117959) 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, 255242558579 + 255242558580.
It is an arithmetic number, because the mean of its divisors is an integer number (255242558580).
Almost surely, 2510485117159 is an apocalyptic number.
510485117159 is a deficient number, since it is larger than the sum of its proper divisors (1).
510485117159 is an equidigital number, since it uses as much as digits as its factorization.
510485117159 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252000, while the sum is 47.
The spelling of 510485117159 in words is "five hundred ten billion, four hundred eighty-five million, one hundred seventeen thousand, one hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •