Search a number
-
+
1345723222097 is a prime number
BaseRepresentation
bin10011100101010011010…
…110101100100001010001
311202122112202122210111102
4103211103112230201101
5134022020121101342
62510114450554145
7166140163440032
oct23452326544121
94678482583442
101345723222097
11479799748751
12198987b98955
1399b93ab8847
14491c1cb8a89
15250130c1832
hex139535ac851

1345723222097 has 2 divisors, whose sum is σ = 1345723222098. Its totient is φ = 1345723222096.

The previous prime is 1345723222043. The next prime is 1345723222111. The reversal of 1345723222097 is 7902223275431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 820864992256 + 524858229841 = 906016^2 + 724471^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1345723222097 - 224 = 1345706444881 is a prime.

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

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

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

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

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

Almost surely, 21345723222097 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 1345723222097 in words is "one trillion, three hundred forty-five billion, seven hundred twenty-three million, two hundred twenty-two thousand, ninety-seven".