Base | Representation |
---|---|
bin | 1100011001010… |
… | …1100101100101 |
3 | 10121211111220012 |
4 | 3012111211211 |
5 | 101302233213 |
6 | 5054220005 |
7 | 1200634616 |
oct | 306254545 |
9 | 117744805 |
10 | 51992933 |
11 | 27392073 |
12 | 154b4605 |
13 | aa05565 |
14 | 6c95c0d |
15 | 48704a8 |
hex | 3195965 |
51992933 has 2 divisors, whose sum is σ = 51992934. Its totient is φ = 51992932.
The previous prime is 51992869. The next prime is 51992939. The reversal of 51992933 is 33929915.
It is a happy number.
51992933 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 can be written as a sum of positive squares in only one way, i.e., 50027329 + 1965604 = 7073^2 + 1402^2 .
It is a cyclic number.
It is not a de Polignac number, because 51992933 - 26 = 51992869 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51992939) 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, 25996466 + 25996467.
It is an arithmetic number, because the mean of its divisors is an integer number (25996467).
Almost surely, 251992933 is an apocalyptic number.
It is an amenable number.
51992933 is a deficient number, since it is larger than the sum of its proper divisors (1).
51992933 is an equidigital number, since it uses as much as digits as its factorization.
51992933 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 65610, while the sum is 41.
The square root of 51992933 is about 7210.6125259925. The cubic root of 51992933 is about 373.2342061616.
It can be divided in two parts, 51992 and 933, that added together give a palindrome (52925).
The spelling of 51992933 in words is "fifty-one million, nine hundred ninety-two thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •