Base | Representation |
---|---|
bin | 1100010000100… |
… | …1110010011111 |
3 | 10120202102102021 |
4 | 3010021302133 |
5 | 101130422234 |
6 | 5034041011 |
7 | 1163031316 |
oct | 304116237 |
9 | 116672367 |
10 | 51420319 |
11 | 27030935 |
12 | 15279167 |
13 | a864a32 |
14 | 6b8727d |
15 | 47aa9b4 |
hex | 3109c9f |
51420319 has 2 divisors, whose sum is σ = 51420320. Its totient is φ = 51420318.
The previous prime is 51420307. The next prime is 51420331. The reversal of 51420319 is 91302415.
51420319 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a balanced prime because it is at equal distance from previous prime (51420307) and next prime (51420331).
It is a cyclic number.
It is not a de Polignac number, because 51420319 - 25 = 51420287 is a prime.
It is a super-2 number, since 2×514203192 = 5288098412123522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 51420293 and 51420302.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51420119) 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, 25710159 + 25710160.
It is an arithmetic number, because the mean of its divisors is an integer number (25710160).
Almost surely, 251420319 is an apocalyptic number.
51420319 is a deficient number, since it is larger than the sum of its proper divisors (1).
51420319 is an equidigital number, since it uses as much as digits as its factorization.
51420319 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1080, while the sum is 25.
The square root of 51420319 is about 7170.7962598306. The cubic root of 51420319 is about 371.8589644381.
The spelling of 51420319 in words is "fifty-one million, four hundred twenty thousand, three hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •