Search a number
-
+
101110011010997 is a prime number
BaseRepresentation
bin10110111111010110000010…
…010010100001111110110101
3111021000000121111212100101112
4112333112002102201332311
5101223041300304322442
6555013144155004405
730203646221101622
oct2677260222417665
9437000544770345
10101110011010997
112a24257331297a
12b40b96a139705
13445582cc95461
141ad7a71aa7349
15ba51840a6082
hex5bf5824a1fb5

101110011010997 has 2 divisors, whose sum is σ = 101110011010998. Its totient is φ = 101110011010996.

The previous prime is 101110011010969. The next prime is 101110011010999. The reversal of 101110011010997 is 799010110011101.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 67862436233956 + 33247574777041 = 8237866^2 + 5766071^2 .

It is a cyclic number.

It is not a de Polignac number, because 101110011010997 - 232 = 101105716043701 is a prime.

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

It is a Chen prime.

It is a congruent number.

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

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

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

Almost surely, 2101110011010997 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 567, while the sum is 32.

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