Base | Representation |
---|---|
bin | 111001010101011111100100… |
… | …1111010011111111111011101 |
3 | 2110010200121022200112212120211 |
4 | 1302222333021322133333131 |
5 | 1012100431032040312023 |
6 | 4544342340550012421 |
7 | 211141510364464303 |
oct | 16252771172377735 |
9 | 2403617280485524 |
10 | 504331332354013 |
11 | 13677179824aa8a |
12 | 4869295a947111 |
13 | 18854318708668 |
14 | 8c77aa3c8a273 |
15 | 3d48c36b22a0d |
hex | 1caafc9e9ffdd |
504331332354013 has 2 divisors, whose sum is σ = 504331332354014. Its totient is φ = 504331332354012.
The previous prime is 504331332353941. The next prime is 504331332354019. The reversal of 504331332354013 is 310453233133405.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 281869245037444 + 222462087316569 = 16788962^2 + 14915163^2 .
It is a cyclic number.
It is not a de Polignac number, because 504331332354013 - 237 = 504193893400541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (504331332354019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 252165666177006 + 252165666177007.
It is an arithmetic number, because the mean of its divisors is an integer number (252165666177007).
Almost surely, 2504331332354013 is an apocalyptic number.
It is an amenable number.
504331332354013 is a deficient number, since it is larger than the sum of its proper divisors (1).
504331332354013 is an equidigital number, since it uses as much as digits as its factorization.
504331332354013 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 583200, while the sum is 40.
Adding to 504331332354013 its reverse (310453233133405), we get a palindrome (814784565487418).
The spelling of 504331332354013 in words is "five hundred four trillion, three hundred thirty-one billion, three hundred thirty-two million, three hundred fifty-four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •