Search a number
-
+
101111000110997 is a prime number
BaseRepresentation
bin10110111111010110111101…
…001111101001011110010101
3111021000010011110000211111212
4112333112331033221132111
5101223100312012022442
6555013430250511205
730204012561234242
oct2677267517513625
9437003143024455
10101111000110997
112a242a30671398
12b40bba5435505
134455959b87226
141ad7b271b85c9
15ba51e0d32a82
hex5bf5bd3e9795

101111000110997 has 2 divisors, whose sum is σ = 101111000110998. Its totient is φ = 101111000110996.

The previous prime is 101111000110951. The next prime is 101111000111129. The reversal of 101111000110997 is 799011000111101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 99692516728996 + 1418483382001 = 9984614^2 + 1191001^2 .

It is a cyclic number.

It is not a de Polignac number, because 101111000110997 - 226 = 101110933002133 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2101111000110997 is an apocalyptic number.

It is an amenable number.

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

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

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

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

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