Base | Representation |
---|---|
bin | 11111101010111… |
… | …111100011000101 |
3 | 1101000212002102112 |
4 | 133222333203011 |
5 | 2042012122122 |
6 | 124420550405 |
7 | 16111343201 |
oct | 3752774305 |
9 | 1330762375 |
10 | 531364037 |
11 | 252a39736 |
12 | 129b52405 |
13 | 86116bb9 |
14 | 507dbb01 |
15 | 319b12e2 |
hex | 1fabf8c5 |
531364037 has 2 divisors, whose sum is σ = 531364038. Its totient is φ = 531364036.
The previous prime is 531364003. The next prime is 531364073. The reversal of 531364037 is 730463135.
Together with next prime (531364073) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 530795521 + 568516 = 23039^2 + 754^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-531364037 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 531363994 and 531364012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (531363037) 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, 265682018 + 265682019.
It is an arithmetic number, because the mean of its divisors is an integer number (265682019).
Almost surely, 2531364037 is an apocalyptic number.
It is an amenable number.
531364037 is a deficient number, since it is larger than the sum of its proper divisors (1).
531364037 is an equidigital number, since it uses as much as digits as its factorization.
531364037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680, while the sum is 32.
The square root of 531364037 is about 23051.3348203526. The cubic root of 531364037 is about 809.9608968574.
The spelling of 531364037 in words is "five hundred thirty-one million, three hundred sixty-four thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •