Base | Representation |
---|---|
bin | 1100010011001… |
… | …1011111101111 |
3 | 10121002002202101 |
4 | 3010303133233 |
5 | 101201404101 |
6 | 5041435531 |
7 | 1164342343 |
oct | 304633757 |
9 | 117062671 |
10 | 51591151 |
11 | 27138217 |
12 | 1533bba7 |
13 | a8c4711 |
14 | 6bcd623 |
15 | 47e1401 |
hex | 31337ef |
51591151 has 2 divisors, whose sum is σ = 51591152. Its totient is φ = 51591150.
The previous prime is 51591149. The next prime is 51591173. The reversal of 51591151 is 15119515.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 51591151 - 21 = 51591149 is a prime.
Together with 51591149, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51591121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25795575 + 25795576.
It is an arithmetic number, because the mean of its divisors is an integer number (25795576).
Almost surely, 251591151 is an apocalyptic number.
51591151 is a deficient number, since it is larger than the sum of its proper divisors (1).
51591151 is an equidigital number, since it uses as much as digits as its factorization.
51591151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1125, while the sum is 28.
The square root of 51591151 is about 7182.6980306846. The cubic root of 51591151 is about 372.2703140885.
The spelling of 51591151 in words is "fifty-one million, five hundred ninety-one thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •