Search a number
-
+
1359070607 is a prime number
BaseRepresentation
bin101000100000001…
…1100010110001111
310111201022221101102
41101000130112033
510240410224412
6342505333315
745451623656
oct12100342617
93451287342
101359070607
11638183954
1231b19723b
1318874abbb
14cc6da19d
157e4ac8c2
hex5101c58f

1359070607 has 2 divisors, whose sum is σ = 1359070608. Its totient is φ = 1359070606.

The previous prime is 1359070591. The next prime is 1359070619. The reversal of 1359070607 is 7060709531.

It is a strong prime.

It is an emirp because it is prime and its reverse (7060709531) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 1359070607 - 24 = 1359070591 is a prime.

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

It is a congruent number.

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

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

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

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

Almost surely, 21359070607 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 39690, while the sum is 38.

The square root of 1359070607 is about 36865.5748225902. The cubic root of 1359070607 is about 1107.6792154271.

The spelling of 1359070607 in words is "one billion, three hundred fifty-nine million, seventy thousand, six hundred seven".