Base | Representation |
---|---|
bin | 11111101001111… |
… | …111001010011001 |
3 | 1101000100200122222 |
4 | 133221333022121 |
5 | 2041430202223 |
6 | 124411153425 |
7 | 16106164262 |
oct | 3751771231 |
9 | 1330320588 |
10 | 531100313 |
11 | 252879587 |
12 | 129a45875 |
13 | 86053b53 |
14 | 5076d969 |
15 | 3195d0c8 |
hex | 1fa7f299 |
531100313 has 2 divisors, whose sum is σ = 531100314. Its totient is φ = 531100312.
The previous prime is 531100289. The next prime is 531100321. The reversal of 531100313 is 313001135.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 527758729 + 3341584 = 22973^2 + 1828^2 .
It is a cyclic number.
It is not a de Polignac number, because 531100313 - 26 = 531100249 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 531100291 and 531100300.
It is not a weakly prime, because it can be changed into another prime (531100363) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265550156 + 265550157.
It is an arithmetic number, because the mean of its divisors is an integer number (265550157).
Almost surely, 2531100313 is an apocalyptic number.
It is an amenable number.
531100313 is a deficient number, since it is larger than the sum of its proper divisors (1).
531100313 is an equidigital number, since it uses as much as digits as its factorization.
531100313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135, while the sum is 17.
The square root of 531100313 is about 23045.6137475225. The cubic root of 531100313 is about 809.8268760725.
Adding to 531100313 its reverse (313001135), we get a palindrome (844101448).
The spelling of 531100313 in words is "five hundred thirty-one million, one hundred thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •