Base | Representation |
---|---|
bin | 1110101101001000010… |
… | …01111111001011100001 |
3 | 1210022011210201101110001 |
4 | 13112210021333023201 |
5 | 31234240401131022 |
6 | 1024040551540001 |
7 | 51334641543406 |
oct | 7264411771341 |
9 | 1708153641401 |
10 | 505265255137 |
11 | 185311078625 |
12 | 81b1038a601 |
13 | 38852c30866 |
14 | 1a6526122ad |
15 | d222ed3b27 |
hex | 75a427f2e1 |
505265255137 has 2 divisors, whose sum is σ = 505265255138. Its totient is φ = 505265255136.
The previous prime is 505265255101. The next prime is 505265255171. The reversal of 505265255137 is 731552562505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 384355361296 + 120909893841 = 619964^2 + 347721^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-505265255137 is a prime.
It is not a weakly prime, because it can be changed into another prime (505265255197) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252632627568 + 252632627569.
It is an arithmetic number, because the mean of its divisors is an integer number (252632627569).
Almost surely, 2505265255137 is an apocalyptic number.
It is an amenable number.
505265255137 is a deficient number, since it is larger than the sum of its proper divisors (1).
505265255137 is an equidigital number, since it uses as much as digits as its factorization.
505265255137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1575000, while the sum is 46.
The spelling of 505265255137 in words is "five hundred five billion, two hundred sixty-five million, two hundred fifty-five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •