Search a number
-
+
1001105905697 is a prime number
BaseRepresentation
bin11101001000101101000…
…11111101100000100001
310112201000210101020220022
432210112203331200201
5112400231102440242
62043522433523225
7132220223536622
oct16442643754041
93481023336808
101001105905697
11356626204247
12142030413515
1373533436601
143664d281a49
151b0938b70d2
hexe9168fd821

1001105905697 has 2 divisors, whose sum is σ = 1001105905698. Its totient is φ = 1001105905696.

The previous prime is 1001105905687. The next prime is 1001105905699. The reversal of 1001105905697 is 7965095011001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 958472328256 + 42633577441 = 979016^2 + 206479^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1001105905697 - 226 = 1001038796833 is a prime.

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

It is a Chen prime.

It is not a weakly prime, because it can be changed into another prime (1001105905699) 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, 500552952848 + 500552952849.

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

Almost surely, 21001105905697 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 85050, while the sum is 44.

The spelling of 1001105905697 in words is "one trillion, one billion, one hundred five million, nine hundred five thousand, six hundred ninety-seven".