Search a number
-
+
630151157 is a prime number
BaseRepresentation
bin100101100011110…
…101011111110101
31121220201222212202
4211203311133311
52242304314112
6142310154245
721421124246
oct4543653765
91556658782
10630151157
112a3781989
12157052985
13a072460c
145d994ccd
153a4c66c2
hex258f57f5

630151157 has 2 divisors, whose sum is σ = 630151158. Its totient is φ = 630151156.

The previous prime is 630151139. The next prime is 630151177. The reversal of 630151157 is 751151036.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 515789521 + 114361636 = 22711^2 + 10694^2 .

It is a cyclic number.

It is not a de Polignac number, because 630151157 - 210 = 630150133 is a prime.

It is a Chen prime.

It is equal to p32814704 and since 630151157 and 32814704 have the same sum of digits, it is a Honaker prime.

It is a congruent number.

It is not a weakly prime, because it can be changed into another prime (630151117) by changing a digit.

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 315075578 + 315075579.

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

Almost surely, 2630151157 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3150, while the sum is 29.

The square root of 630151157 is about 25102.8117349432. The cubic root of 630151157 is about 857.3304441959.

The spelling of 630151157 in words is "six hundred thirty million, one hundred fifty-one thousand, one hundred fifty-seven".