Base | Representation |
---|---|
bin | 1100001100101… |
… | …0010110010111 |
3 | 10120021012222021 |
4 | 3003022112113 |
5 | 101044113341 |
6 | 5024314011 |
7 | 1160566615 |
oct | 303122627 |
9 | 116235867 |
10 | 51160471 |
11 | 2697368a |
12 | 15172907 |
13 | a7a368b |
14 | 6b1a6b5 |
15 | 47589d1 |
hex | 30ca597 |
51160471 has 2 divisors, whose sum is σ = 51160472. Its totient is φ = 51160470.
The previous prime is 51160469. The next prime is 51160477. The reversal of 51160471 is 17406115.
It is a happy number.
51160471 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 51160471 - 21 = 51160469 is a prime.
It is a super-3 number, since 3×511604713 (a number of 24 digits) contains 333 as substring.
Together with 51160469, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51160477) 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, 25580235 + 25580236.
It is an arithmetic number, because the mean of its divisors is an integer number (25580236).
Almost surely, 251160471 is an apocalyptic number.
51160471 is a deficient number, since it is larger than the sum of its proper divisors (1).
51160471 is an equidigital number, since it uses as much as digits as its factorization.
51160471 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 840, while the sum is 25.
The square root of 51160471 is about 7152.6548218127. The cubic root of 51160471 is about 371.2315209582.
Adding to 51160471 its reverse (17406115), we get a palindrome (68566586).
The spelling of 51160471 in words is "fifty-one million, one hundred sixty thousand, four hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •