Search a number
-
+
651135029 is a prime number
BaseRepresentation
bin100110110011111…
…000100000110101
31200101020002100012
4212303320200311
52313142310104
6144340030005
722064361566
oct4663704065
91611202305
10651135029
11304604426
12162092305
13a4b907cc
146269816d
153c26dd6e
hex26cf8835

651135029 has 2 divisors, whose sum is σ = 651135030. Its totient is φ = 651135028.

The previous prime is 651134993. The next prime is 651135031. The reversal of 651135029 is 920531156.

651135029 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 468939025 + 182196004 = 21655^2 + 13498^2 .

It is a cyclic number.

It is not a de Polignac number, because 651135029 - 28 = 651134773 is a prime.

It is a Sophie Germain prime.

Together with 651135031, it forms a pair of twin primes.

It is a Chen prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 651134986 and 651135004.

It is a congruent number.

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

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

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

Almost surely, 2651135029 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 8100, while the sum is 32.

The square root of 651135029 is about 25517.3476090286. The cubic root of 651135029 is about 866.7430206070.

The spelling of 651135029 in words is "six hundred fifty-one million, one hundred thirty-five thousand, twenty-nine".