Search a number
-
+
1345404908801 is a prime number
BaseRepresentation
bin10011100101000000011…
…000011011010100000001
311202121201120200210202002
4103211000120123110001
5134020342124040201
62510023120233345
7166126250014652
oct23450030332401
94677646623662
101345404908801
11479645aa6208
121988b946b855
1399b42b78295
14491918d9529
1524ee519676b
hex1394061b501

1345404908801 has 2 divisors, whose sum is σ = 1345404908802. Its totient is φ = 1345404908800.

The previous prime is 1345404908761. The next prime is 1345404908831. The reversal of 1345404908801 is 1088094045431.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1097097035776 + 248307873025 = 1047424^2 + 498305^2 .

It is a cyclic number.

It is not a de Polignac number, because 1345404908801 - 26 = 1345404908737 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 21345404908801 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 552960, while the sum is 47.

The spelling of 1345404908801 in words is "one trillion, three hundred forty-five billion, four hundred four million, nine hundred eight thousand, eight hundred one".