Search a number
-
+
1060401709 is a prime number
BaseRepresentation
bin111111001101000…
…111001000101101
32201220022222200101
4333031013020231
54132430323314
6253120031101
735164160113
oct7715071055
92656288611
101060401709
114a4629554
12257162491
1313b8c7c43
14a0b91ab3
1563163174
hex3f34722d

1060401709 has 2 divisors, whose sum is σ = 1060401710. Its totient is φ = 1060401708.

The previous prime is 1060401703. The next prime is 1060401731. The reversal of 1060401709 is 9071040601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 840710025 + 219691684 = 28995^2 + 14822^2 .

It is a cyclic number.

It is not a de Polignac number, because 1060401709 - 23 = 1060401701 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21060401709 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1060401709 is about 32563.8098047510. The cubic root of 1060401709 is about 1019.7416073020.

The spelling of 1060401709 in words is "one billion, sixty million, four hundred one thousand, seven hundred nine".