Base | Representation |
---|---|
bin | 1110101100101110100… |
… | …00110101011000100001 |
3 | 1210021121201200202101021 |
4 | 13112113100311120201 |
5 | 31233320012234314 |
6 | 1024003303405441 |
7 | 51326404132213 |
oct | 7262720653041 |
9 | 1707551622337 |
10 | 505048946209 |
11 | 18520aa66515 |
12 | 81a6ba53881 |
13 | 3881a186202 |
14 | 1a6319c65b3 |
15 | d20e007324 |
hex | 7597435621 |
505048946209 has 2 divisors, whose sum is σ = 505048946210. Its totient is φ = 505048946208.
The previous prime is 505048946167. The next prime is 505048946219. The reversal of 505048946209 is 902649840505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 312369210000 + 192679736209 = 558900^2 + 438953^2 .
It is a cyclic number.
It is not a de Polignac number, because 505048946209 - 29 = 505048945697 is a prime.
It is not a weakly prime, because it can be changed into another prime (505048946219) 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, 252524473104 + 252524473105.
It is an arithmetic number, because the mean of its divisors is an integer number (252524473105).
Almost surely, 2505048946209 is an apocalyptic number.
It is an amenable number.
505048946209 is a deficient number, since it is larger than the sum of its proper divisors (1).
505048946209 is an equidigital number, since it uses as much as digits as its factorization.
505048946209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3110400, while the sum is 52.
The spelling of 505048946209 in words is "five hundred five billion, forty-eight million, nine hundred forty-six thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •