Base | Representation |
---|---|
bin | 111001001110110100100010… |
… | …0110101000001001000110001 |
3 | 2110000102221020010210021110002 |
4 | 1302131221010311001020301 |
5 | 1011440414412001410022 |
6 | 4542401153525315345 |
7 | 211015323641114015 |
oct | 16235510465011061 |
9 | 2400387203707402 |
10 | 503414271513137 |
11 | 1364488803169a6 |
12 | 48565084b65b55 |
13 | 187b89ba47654a |
14 | 8c45548aa8545 |
15 | 3d2ee61902092 |
hex | 1c9da44d41231 |
503414271513137 has 2 divisors, whose sum is σ = 503414271513138. Its totient is φ = 503414271513136.
The previous prime is 503414271512993. The next prime is 503414271513151. The reversal of 503414271513137 is 731315172414305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 336047888528881 + 167366382984256 = 18331609^2 + 12937016^2 .
It is a cyclic number.
It is not a de Polignac number, because 503414271513137 - 216 = 503414271447601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 503414271513091 and 503414271513100.
It is not a weakly prime, because it can be changed into another prime (503414271513187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 251707135756568 + 251707135756569.
It is an arithmetic number, because the mean of its divisors is an integer number (251707135756569).
Almost surely, 2503414271513137 is an apocalyptic number.
It is an amenable number.
503414271513137 is a deficient number, since it is larger than the sum of its proper divisors (1).
503414271513137 is an equidigital number, since it uses as much as digits as its factorization.
503414271513137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1058400, while the sum is 47.
The spelling of 503414271513137 in words is "five hundred three trillion, four hundred fourteen billion, two hundred seventy-one million, five hundred thirteen thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •