Search a number
-
+
1306650601 is a prime number
BaseRepresentation
bin100110111100001…
…1110011111101001
310101001200201122201
41031320132133221
510134000304401
6333354020201
744244226654
oct11570363751
93331621581
101306650601
1161062aa33
12305717661
1317a926149
14c577289b
1579aa5b01
hex4de1e7e9

1306650601 has 2 divisors, whose sum is σ = 1306650602. Its totient is φ = 1306650600.

The previous prime is 1306650557. The next prime is 1306650613. The reversal of 1306650601 is 1060566031.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 919544976 + 387105625 = 30324^2 + 19675^2 .

It is a cyclic number.

It is not a de Polignac number, because 1306650601 - 27 = 1306650473 is a prime.

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

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

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

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

Almost surely, 21306650601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3240, while the sum is 28.

The square root of 1306650601 is about 36147.6223422786. The cubic root of 1306650601 is about 1093.2508512678.

The spelling of 1306650601 in words is "one billion, three hundred six million, six hundred fifty thousand, six hundred one".