Base | Representation |
---|---|
bin | 1100001011010… |
… | …1110101010001 |
3 | 10120002221200202 |
4 | 3002311311101 |
5 | 101033421213 |
6 | 5022424545 |
7 | 1160066612 |
oct | 302656521 |
9 | 116087622 |
10 | 51076433 |
11 | 26916531 |
12 | 15132155 |
13 | a774355 |
14 | 6ad7c09 |
15 | 473db58 |
hex | 30b5d51 |
51076433 has 2 divisors, whose sum is σ = 51076434. Its totient is φ = 51076432.
The previous prime is 51076379. The next prime is 51076439. The reversal of 51076433 is 33467015.
51076433 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., 36084049 + 14992384 = 6007^2 + 3872^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51076433 is a prime.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 51076396 and 51076405.
It is not a weakly prime, because it can be changed into another prime (51076439) 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, 25538216 + 25538217.
It is an arithmetic number, because the mean of its divisors is an integer number (25538217).
Almost surely, 251076433 is an apocalyptic number.
It is an amenable number.
51076433 is a deficient number, since it is larger than the sum of its proper divisors (1).
51076433 is an equidigital number, since it uses as much as digits as its factorization.
51076433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7560, while the sum is 29.
The square root of 51076433 is about 7146.7778054169. Note that the first 3 decimals coincide. The cubic root of 51076433 is about 371.0281435484.
The spelling of 51076433 in words is "fifty-one million, seventy-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •