Base | Representation |
---|---|
bin | 1100001011001… |
… | …0011011000111 |
3 | 10120002020112122 |
4 | 3002302123013 |
5 | 101032444341 |
6 | 5022240155 |
7 | 1160011115 |
oct | 302623307 |
9 | 116066478 |
10 | 51062471 |
11 | 26906a99 |
12 | 1512605b |
13 | a76aba5 |
14 | 6ad2ab5 |
15 | 473994b |
hex | 30b26c7 |
51062471 has 2 divisors, whose sum is σ = 51062472. Its totient is φ = 51062470.
The previous prime is 51062399. The next prime is 51062489. The reversal of 51062471 is 17426015.
51062471 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 is a cyclic number.
It is not a de Polignac number, because 51062471 - 218 = 50800327 is a prime.
It is a super-3 number, since 3×510624713 (a number of 24 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 51062471.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51062491) 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, 25531235 + 25531236.
It is an arithmetic number, because the mean of its divisors is an integer number (25531236).
Almost surely, 251062471 is an apocalyptic number.
51062471 is a deficient number, since it is larger than the sum of its proper divisors (1).
51062471 is an equidigital number, since it uses as much as digits as its factorization.
51062471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1680, while the sum is 26.
The square root of 51062471 is about 7145.8009348148. The cubic root of 51062471 is about 370.9943329973.
Adding to 51062471 its reverse (17426015), we get a palindrome (68488486).
The spelling of 51062471 in words is "fifty-one million, sixty-two thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •