Search a number
-
+
1431555864509 is a prime number
BaseRepresentation
bin10100110101001111011…
…000001111011110111101
312001212002120220210201102
4110311033120033132331
5141423311300131014
63013351522222445
7205266201035021
oct24651730173675
95055076823642
101431555864509
11502134a68361
121b15411b4a25
13a4cc2420a54
144d40553a381
152738866a8de
hex14d4f60f7bd

1431555864509 has 2 divisors, whose sum is σ = 1431555864510. Its totient is φ = 1431555864508.

The previous prime is 1431555864503. The next prime is 1431555864511. The reversal of 1431555864509 is 9054685551341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1284754240900 + 146801623609 = 1133470^2 + 383147^2 .

It is a cyclic number.

It is not a de Polignac number, because 1431555864509 - 24 = 1431555864493 is a prime.

It is a super-2 number, since 2×14315558645092 (a number of 25 digits) contains 22 as substring.

Together with 1431555864511, it forms a pair of twin primes.

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 21431555864509 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12960000, while the sum is 56.

The spelling of 1431555864509 in words is "one trillion, four hundred thirty-one billion, five hundred fifty-five million, eight hundred sixty-four thousand, five hundred nine".