Base | Representation |
---|---|
bin | 111001001110010011000101… |
… | …1111111101101001100011101 |
3 | 2110000012001211211220220012121 |
4 | 1302130212023333231030131 |
5 | 1011433230314432201331 |
6 | 4542304155123502541 |
7 | 211010202110224264 |
oct | 16234461377551435 |
9 | 2400161754826177 |
10 | 503342451053341 |
11 | 1364203755664a9 |
12 | 48553180527a51 |
13 | 187b1cb2b27363 |
14 | 8c41c943b15db |
15 | 3d2d15b595c11 |
hex | 1c9c98bfed31d |
503342451053341 has 2 divisors, whose sum is σ = 503342451053342. Its totient is φ = 503342451053340.
The previous prime is 503342451053269. The next prime is 503342451053357. The reversal of 503342451053341 is 143350154243305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 430153656101316 + 73188794952025 = 20740146^2 + 8555045^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-503342451053341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (503342451053371) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 251671225526670 + 251671225526671.
It is an arithmetic number, because the mean of its divisors is an integer number (251671225526671).
Almost surely, 2503342451053341 is an apocalyptic number.
It is an amenable number.
503342451053341 is a deficient number, since it is larger than the sum of its proper divisors (1).
503342451053341 is an equidigital number, since it uses as much as digits as its factorization.
503342451053341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296000, while the sum is 43.
The spelling of 503342451053341 in words is "five hundred three trillion, three hundred forty-two billion, four hundred fifty-one million, fifty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •