Base | Representation |
---|---|
bin | 1100001100110… |
… | …0011111001111 |
3 | 10120021122222201 |
4 | 3003030133033 |
5 | 101044403411 |
6 | 5024422331 |
7 | 1160634301 |
oct | 303143717 |
9 | 116248881 |
10 | 51169231 |
11 | 2697a223 |
12 | 151779a7 |
13 | a7a7669 |
14 | 6b1d971 |
15 | 475b3c1 |
hex | 30cc7cf |
51169231 has 2 divisors, whose sum is σ = 51169232. Its totient is φ = 51169230.
The previous prime is 51169213. The next prime is 51169247. The reversal of 51169231 is 13296115.
Together with previous prime (51169213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 51169231 - 27 = 51169103 is a prime.
It is a super-2 number, since 2×511692312 = 5236580402262722, which contains 22 as substring.
It is a Chen prime.
It is a zygodrome in base 2.
It is a self number, because there is not a number n which added to its sum of digits gives 51169231.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51169291) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25584615 + 25584616.
It is an arithmetic number, because the mean of its divisors is an integer number (25584616).
Almost surely, 251169231 is an apocalyptic number.
51169231 is a deficient number, since it is larger than the sum of its proper divisors (1).
51169231 is an equidigital number, since it uses as much as digits as its factorization.
51169231 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1620, while the sum is 28.
The square root of 51169231 is about 7153.2671556429. The cubic root of 51169231 is about 371.2527079050.
The spelling of 51169231 in words is "fifty-one million, one hundred sixty-nine thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •