Base | Representation |
---|---|
bin | 1101100111110… |
… | …0001000001011 |
3 | 10222111120201122 |
4 | 3121330020023 |
5 | 104111202111 |
6 | 5400305455 |
7 | 1262416142 |
oct | 331741013 |
9 | 128446648 |
10 | 57131531 |
11 | 2a281846 |
12 | 1717228b |
13 | bab4452 |
14 | 7832759 |
15 | 5037cdb |
hex | 367c20b |
57131531 has 2 divisors, whose sum is σ = 57131532. Its totient is φ = 57131530.
The previous prime is 57131521. The next prime is 57131533. The reversal of 57131531 is 13513175.
57131531 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 57131531 - 26 = 57131467 is a prime.
It is a super-2 number, since 2×571315312 = 6528023668807922, which contains 22 as substring.
Together with 57131533, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 57131531.
It is not a weakly prime, because it can be changed into another prime (57131533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28565765 + 28565766.
It is an arithmetic number, because the mean of its divisors is an integer number (28565766).
Almost surely, 257131531 is an apocalyptic number.
57131531 is a deficient number, since it is larger than the sum of its proper divisors (1).
57131531 is an equidigital number, since it uses as much as digits as its factorization.
57131531 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1575, while the sum is 26.
The square root of 57131531 is about 7558.5402691260. The cubic root of 57131531 is about 385.1459074787.
The spelling of 57131531 in words is "fifty-seven million, one hundred thirty-one thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •