Search a number
-
+
4956151 is a prime number
BaseRepresentation
bin10010111001111111110111
3100022210120011
4102321333313
52232044101
6254121051
760061264
oct22717767
910283504
104956151
1128856a2
1217b0187
131046b45
1493026b
1567d751
hex4b9ff7

4956151 has 2 divisors, whose sum is σ = 4956152. Its totient is φ = 4956150.

The previous prime is 4956139. The next prime is 4956157. The reversal of 4956151 is 1516594.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 4956151 - 27 = 4956023 is a prime.

It is a Chen prime.

It is a congruent number.

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

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

Almost surely, 24956151 is an apocalyptic number.

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

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

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

The product of its digits is 5400, while the sum is 31.

The square root of 4956151 is about 2226.2414514154. The cubic root of 4956151 is about 170.4962546799.

It can be divided in two parts, 495615 and 1, that added together give a square (495616 = 7042).

The spelling of 4956151 in words is "four million, nine hundred fifty-six thousand, one hundred fifty-one".