Base | Representation |
---|---|
bin | 11111101111011… |
… | …000000111001111 |
3 | 1101010000110211021 |
4 | 133233120013033 |
5 | 2042310410411 |
6 | 124501335011 |
7 | 16124200465 |
oct | 3757300717 |
9 | 1333013737 |
10 | 532513231 |
11 | 253654088 |
12 | 12a407467 |
13 | 86429cb3 |
14 | 50a1a835 |
15 | 31b3ba71 |
hex | 1fbd81cf |
532513231 has 2 divisors, whose sum is σ = 532513232. Its totient is φ = 532513230.
The previous prime is 532513229. The next prime is 532513237. The reversal of 532513231 is 132315235.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 532513231 - 21 = 532513229 is a prime.
It is a super-2 number, since 2×5325132312 = 567140682380118722, which contains 22 as substring.
Together with 532513229, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 532513196 and 532513205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (532513237) 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, 266256615 + 266256616.
It is an arithmetic number, because the mean of its divisors is an integer number (266256616).
Almost surely, 2532513231 is an apocalyptic number.
532513231 is a deficient number, since it is larger than the sum of its proper divisors (1).
532513231 is an equidigital number, since it uses as much as digits as its factorization.
532513231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2700, while the sum is 25.
The square root of 532513231 is about 23076.2482002599. The cubic root of 532513231 is about 810.5443838333.
Adding to 532513231 its reverse (132315235), we get a palindrome (664828466).
The spelling of 532513231 in words is "five hundred thirty-two million, five hundred thirteen thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •