Base | Representation |
---|---|
bin | 1100001111110… |
… | …0100100000111 |
3 | 10120122200010001 |
4 | 3003330210013 |
5 | 101122204101 |
6 | 5032542131 |
7 | 1162414354 |
oct | 303744407 |
9 | 116580101 |
10 | 51366151 |
11 | 26aa4171 |
12 | 15251947 |
13 | a846195 |
14 | 6b7162b |
15 | 4799901 |
hex | 30fc907 |
51366151 has 2 divisors, whose sum is σ = 51366152. Its totient is φ = 51366150.
The previous prime is 51366143. The next prime is 51366173. The reversal of 51366151 is 15166315.
51366151 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 51366151 - 23 = 51366143 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51366121) 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, 25683075 + 25683076.
It is an arithmetic number, because the mean of its divisors is an integer number (25683076).
Almost surely, 251366151 is an apocalyptic number.
51366151 is a deficient number, since it is larger than the sum of its proper divisors (1).
51366151 is an equidigital number, since it uses as much as digits as its factorization.
51366151 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2700, while the sum is 28.
The square root of 51366151 is about 7167.0182781963. The cubic root of 51366151 is about 371.7283420565.
The spelling of 51366151 in words is "fifty-one million, three hundred sixty-six thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •