Base | Representation |
---|---|
bin | 111001001110110111010001… |
… | …1100010101101000100001101 |
3 | 2110000110111102012120112210112 |
4 | 1302131232203202231010031 |
5 | 1011441013434302441044 |
6 | 4542404005440045405 |
7 | 211015622516236565 |
oct | 16235564342550415 |
9 | 2400414365515715 |
10 | 503420155515149 |
11 | 13645031a719784 |
12 | 48566247603865 |
13 | 187b94174b9b42 |
14 | 8c4594631dda5 |
15 | 3d301a827509e |
hex | 1c9dba38ad10d |
503420155515149 has 2 divisors, whose sum is σ = 503420155515150. Its totient is φ = 503420155515148.
The previous prime is 503420155515083. The next prime is 503420155515163. The reversal of 503420155515149 is 941515551024305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 319158046350025 + 184262109165124 = 17864995^2 + 13574318^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-503420155515149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 503420155515097 and 503420155515106.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (503420155515169) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 251710077757574 + 251710077757575.
It is an arithmetic number, because the mean of its divisors is an integer number (251710077757575).
Almost surely, 2503420155515149 is an apocalyptic number.
It is an amenable number.
503420155515149 is a deficient number, since it is larger than the sum of its proper divisors (1).
503420155515149 is an equidigital number, since it uses as much as digits as its factorization.
503420155515149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700000, while the sum is 50.
The spelling of 503420155515149 in words is "five hundred three trillion, four hundred twenty billion, one hundred fifty-five million, five hundred fifteen thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •