Search a number
-
+
1430604953597 is a prime number
BaseRepresentation
bin10100110100010110101…
…100110011011111111101
312001202122022121112011202
4110310112230303133331
5141414334332003342
63013113313025245
7205233503316011
oct24642654633775
95052568545152
101430604953597
11501797222976
121b1316855225
13a4ba0410481
144d35512a541
152732ee34332
hex14d16b337fd

1430604953597 has 2 divisors, whose sum is σ = 1430604953598. Its totient is φ = 1430604953596.

The previous prime is 1430604953527. The next prime is 1430604953599. The reversal of 1430604953597 is 7953594060341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 916363938361 + 514241015236 = 957269^2 + 717106^2 .

It is a cyclic number.

It is not a de Polignac number, because 1430604953597 - 210 = 1430604952573 is a prime.

Together with 1430604953599, 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 (1430604953599) by changing a digit.

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

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

Almost surely, 21430604953597 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1430604953597 in words is "one trillion, four hundred thirty billion, six hundred four million, nine hundred fifty-three thousand, five hundred ninety-seven".