Base | Representation |
---|---|
bin | 1100011000011… |
… | …0110100001111 |
3 | 10121201102220101 |
4 | 3012012310033 |
5 | 101243314211 |
6 | 5053031531 |
7 | 1200263335 |
oct | 306066417 |
9 | 117642811 |
10 | 51932431 |
11 | 27350671 |
12 | 154855a7 |
13 | a9b3b65 |
14 | 6c7bb55 |
15 | 485c5c1 |
hex | 3186d0f |
51932431 has 2 divisors, whose sum is σ = 51932432. Its totient is φ = 51932430.
The previous prime is 51932429. The next prime is 51932443. The reversal of 51932431 is 13423915.
51932431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51932431 - 21 = 51932429 is a prime.
It is a super-2 number, since 2×519324312 = 5393954779139522, which contains 22 as substring.
Together with 51932429, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 51932431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51932131) 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, 25966215 + 25966216.
It is an arithmetic number, because the mean of its divisors is an integer number (25966216).
Almost surely, 251932431 is an apocalyptic number.
51932431 is a deficient number, since it is larger than the sum of its proper divisors (1).
51932431 is an equidigital number, since it uses as much as digits as its factorization.
51932431 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3240, while the sum is 28.
The square root of 51932431 is about 7206.4159607949. The cubic root of 51932431 is about 373.0893776287.
The spelling of 51932431 in words is "fifty-one million, nine hundred thirty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •