Base | Representation |
---|---|
bin | 1100101100010… |
… | …0000110011111 |
3 | 10201011110121201 |
4 | 3023010012133 |
5 | 102111411111 |
6 | 5140540331 |
7 | 1214315266 |
oct | 313040637 |
9 | 121143551 |
10 | 53232031 |
11 | 28059016 |
12 | 159b16a7 |
13 | b04a558 |
14 | 70d95dd |
15 | 4a176c1 |
hex | 32c419f |
53232031 has 2 divisors, whose sum is σ = 53232032. Its totient is φ = 53232030.
The previous prime is 53232013. The next prime is 53232071. The reversal of 53232031 is 13023235.
53232031 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (53232013) 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 53232031 - 211 = 53229983 is a prime.
It is a super-2 number, since 2×532320312 = 5667298248769922, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (53232001) 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, 26616015 + 26616016.
It is an arithmetic number, because the mean of its divisors is an integer number (26616016).
Almost surely, 253232031 is an apocalyptic number.
53232031 is a deficient number, since it is larger than the sum of its proper divisors (1).
53232031 is an equidigital number, since it uses as much as digits as its factorization.
53232031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 540, while the sum is 19.
The square root of 53232031 is about 7296.0284401858. The cubic root of 53232031 is about 376.1759376377.
Adding to 53232031 its reverse (13023235), we get a palindrome (66255266).
The spelling of 53232031 in words is "fifty-three million, two hundred thirty-two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •