Search a number
-
+
1360443197 is a prime number
BaseRepresentation
bin101000100010110…
…1011011100111101
310111210220200020002
41101011223130331
510241233140242
6342555004045
745466401461
oct12105533475
93453820202
101360443197
11638a31123
1231b739625
13188b0b899
14cc9764a1
157e67e432
hex5116b73d

1360443197 has 2 divisors, whose sum is σ = 1360443198. Its totient is φ = 1360443196.

The previous prime is 1360443143. The next prime is 1360443211. The reversal of 1360443197 is 7913440631.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1013403556 + 347039641 = 31834^2 + 18629^2 .

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

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1360443197 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21360443197 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1360443197 is about 36884.1862727104. The cubic root of 1360443197 is about 1108.0519892564.

The spelling of 1360443197 in words is "one billion, three hundred sixty million, four hundred forty-three thousand, one hundred ninety-seven".