Search a number
-
+
1101101110097 is a prime number
BaseRepresentation
bin10000000001011110101…
…111011001001101010001
310220021010121222221211012
4100001132233121031101
5121020023341010342
62201501110100305
7142360212003032
oct20013657311521
93807117887735
101101101110097
11394a7996433a
1215949864a695
137caaac57301
143b417814a89
151d9974a5b82
hex1005ebd9351

1101101110097 has 2 divisors, whose sum is σ = 1101101110098. Its totient is φ = 1101101110096.

The previous prime is 1101101110051. The next prime is 1101101110099. The reversal of 1101101110097 is 7900111011011.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 924041935441 + 177059174656 = 961271^2 + 420784^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1101101110097 is a prime.

Together with 1101101110099, 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 (1101101110099) 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, 550550555048 + 550550555049.

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

Almost surely, 21101101110097 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 63, while the sum is 23.

The spelling of 1101101110097 in words is "one trillion, one hundred one billion, one hundred one million, one hundred ten thousand, ninety-seven".