Search a number
-
+
630251646151991 is a prime number
BaseRepresentation
bin1000111101001101011110010…
…1011111001110110100110111
310001122112110122212012222022212
42033103113211133032310313
51130102020332403330431
610112233335330044035
7246516115216646153
oct21723274537166467
93048473585188285
10630251646151991
111728aa249698636
125a82aba911961b
132108962407c596
14b18c4b18d6063
154cce45957972b
hex23d35e57ced37

630251646151991 has 2 divisors, whose sum is σ = 630251646151992. Its totient is φ = 630251646151990.

The previous prime is 630251646151957. The next prime is 630251646152041. The reversal of 630251646151991 is 199151646152036.

It is a weak prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-630251646151991 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 2630251646151991 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10497600, while the sum is 59.

The spelling of 630251646151991 in words is "six hundred thirty trillion, two hundred fifty-one billion, six hundred forty-six million, one hundred fifty-one thousand, nine hundred ninety-one".