Search a number
-
+
1065555607 is a prime number
BaseRepresentation
bin111111100000110…
…001011010010111
32202021000211111111
4333200301122113
54140240234412
6253422315451
735256034054
oct7740613227
92667024444
101065555607
114a7529776
12258a28b87
1313c9b0a9c
14a173402b
15638302a7
hex3f831697

1065555607 has 2 divisors, whose sum is σ = 1065555608. Its totient is φ = 1065555606.

The previous prime is 1065555581. The next prime is 1065555629. The reversal of 1065555607 is 7065555601.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1065555607 - 215 = 1065522839 is a prime.

It is a super-2 number, since 2×10655556072 = 2270817503218276898, 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 1065555607.

It is a congruent number.

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

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

Almost surely, 21065555607 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 157500, while the sum is 40.

The square root of 1065555607 is about 32642.8492475764. The cubic root of 1065555607 is about 1021.3910301537.

The spelling of 1065555607 in words is "one billion, sixty-five million, five hundred fifty-five thousand, six hundred seven".