[go: up one dir, main page]

Search a number
-
+
51067151 is a prime number
BaseRepresentation
bin1100001011001…
…1100100001111
310120002110221222
43002303210033
5101033122101
65022313555
71160030552
oct302634417
9116073858
1051067151
112690a563
12151288bb
13a770065
146ad4699
15473b01b
hex30b390f

51067151 has 2 divisors, whose sum is σ = 51067152. Its totient is φ = 51067150.

The previous prime is 51067147. The next prime is 51067157. The reversal of 51067151 is 15176015.

51067151 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 51067151 - 22 = 51067147 is a prime.

It is a super-2 number, since 2×510671512 = 5215707822513602, which contains 22 as substring.

It is a Sophie Germain prime.

It is a Chen prime.

It is a self number, because there is not a number n which added to its sum of digits gives 51067151.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (51067157) 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, 25533575 + 25533576.

It is an arithmetic number, because the mean of its divisors is an integer number (25533576).

Almost surely, 251067151 is an apocalyptic number.

51067151 is a deficient number, since it is larger than the sum of its proper divisors (1).

51067151 is an equidigital number, since it uses as much as digits as its factorization.

51067151 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 1050, while the sum is 26.

The square root of 51067151 is about 7146.1283923534. The cubic root of 51067151 is about 371.0056668295.

The spelling of 51067151 in words is "fifty-one million, sixty-seven thousand, one hundred fifty-one".