Base | Representation |
---|---|
bin | 1100010000110… |
… | …1001010111011 |
3 | 10120210010102022 |
4 | 3010031022323 |
5 | 101131343141 |
6 | 5034225055 |
7 | 1163116565 |
oct | 304151273 |
9 | 116703368 |
10 | 51434171 |
11 | 27040288 |
12 | 1528518b |
13 | a86b129 |
14 | 6b8c335 |
15 | 47aeb4b |
hex | 310d2bb |
51434171 has 2 divisors, whose sum is σ = 51434172. Its totient is φ = 51434170.
The previous prime is 51434093. The next prime is 51434179. The reversal of 51434171 is 17143415.
51434171 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 a de Polignac number, because none of the positive numbers 2k-51434171 is a prime.
It is a super-3 number, since 3×514341713 (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 51434171.
It is not a weakly prime, because it can be changed into another prime (51434179) 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, 25717085 + 25717086.
It is an arithmetic number, because the mean of its divisors is an integer number (25717086).
Almost surely, 251434171 is an apocalyptic number.
51434171 is a deficient number, since it is larger than the sum of its proper divisors (1).
51434171 is an equidigital number, since it uses as much as digits as its factorization.
51434171 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1680, while the sum is 26.
The square root of 51434171 is about 7171.7620568449. The cubic root of 51434171 is about 371.8923528470.
Adding to 51434171 its reverse (17143415), we get a palindrome (68577586).
The spelling of 51434171 in words is "fifty-one million, four hundred thirty-four thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •