Base | Representation |
---|---|
bin | 1111011101011100000… |
… | …01001010111111000011 |
3 | 1212210010021111100122012 |
4 | 13232232001022333003 |
5 | 32200344313121011 |
6 | 1044010302403135 |
7 | 53243433631031 |
oct | 7565601127703 |
9 | 1783107440565 |
10 | 531200520131 |
11 | 19530a933026 |
12 | 86b49b904ab |
13 | 3b127159cc8 |
14 | 1b9d2c95551 |
15 | dc3ed4ba8b |
hex | 7bae04afc3 |
531200520131 has 2 divisors, whose sum is σ = 531200520132. Its totient is φ = 531200520130.
The previous prime is 531200520113. The next prime is 531200520163. The reversal of 531200520131 is 131025002135.
It is a happy number.
Together with previous prime (531200520113) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 531200520131 - 214 = 531200503747 is a prime.
It is a super-2 number, since 2×5312005201312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 531200520097 and 531200520106.
It is not a weakly prime, because it can be changed into another prime (531200520031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 265600260065 + 265600260066.
It is an arithmetic number, because the mean of its divisors is an integer number (265600260066).
Almost surely, 2531200520131 is an apocalyptic number.
531200520131 is a deficient number, since it is larger than the sum of its proper divisors (1).
531200520131 is an equidigital number, since it uses as much as digits as its factorization.
531200520131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 900, while the sum is 23.
Adding to 531200520131 its reverse (131025002135), we get a palindrome (662225522266).
The spelling of 531200520131 in words is "five hundred thirty-one billion, two hundred million, five hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •