Search a number
-
+
1093665139573 is a prime number
BaseRepresentation
bin11111110101000111000…
…01011010101101110101
310212112221101220111220111
433322203201122231311
5120404311233431243
62154231155303021
7142005020205466
oct17724341325565
93775841814814
101093665139573
11391903506656
12157b622aaa71
137c194527356
143ad1000cd6d
151d6ae77039d
hexfea385ab75

1093665139573 has 2 divisors, whose sum is σ = 1093665139574. Its totient is φ = 1093665139572.

The previous prime is 1093665139571. The next prime is 1093665139601. The reversal of 1093665139573 is 3759315663901.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 792771202129 + 300893937444 = 890377^2 + 548538^2 .

It is a cyclic number.

It is not a de Polignac number, because 1093665139573 - 21 = 1093665139571 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 21093665139573 is an apocalyptic number.

It is an amenable number.

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

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

1093665139573 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 13778100, while the sum is 58.

The spelling of 1093665139573 in words is "one trillion, ninety-three billion, six hundred sixty-five million, one hundred thirty-nine thousand, five hundred seventy-three".