Search a number
-
+
1344555697 is a prime number
BaseRepresentation
bin101000000100100…
…0100101010110001
310110201000111200011
41100021010222301
510223201240242
6341230254521
745214351312
oct12011045261
93421014604
101344555697
1162aa6a661
12316357441
131857382b4
14ca7dc609
157d091d17
hex50244ab1

1344555697 has 2 divisors, whose sum is σ = 1344555698. Its totient is φ = 1344555696.

The previous prime is 1344555679. The next prime is 1344555713. The reversal of 1344555697 is 7965554431.

Together with previous prime (1344555679) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 752898721 + 591656976 = 27439^2 + 24324^2 .

It is a cyclic number.

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

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

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

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

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

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

Almost surely, 21344555697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 2268000, while the sum is 49.

The square root of 1344555697 is about 36668.1837155865. The cubic root of 1344555697 is about 1103.7217454174.

The spelling of 1344555697 in words is "one billion, three hundred forty-four million, five hundred fifty-five thousand, six hundred ninety-seven".