Search a number
-
+
100000101197 is a prime number
BaseRepresentation
bin101110100100001111…
…0000111001101001101
3100120010011211111001202
41131020132013031031
53114300011214242
6113534525115245
710140044556353
oct1351036071515
9316104744052
10100000101197
11394564a5137
12174699b8b25
139578846819
144ba90897d3
152904259932
hex174878734d

100000101197 has 2 divisors, whose sum is σ = 100000101198. Its totient is φ = 100000101196.

The previous prime is 100000101163. The next prime is 100000101203. The reversal of 100000101197 is 791101000001.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 52746471556 + 47253629641 = 229666^2 + 217379^2 .

It is a cyclic number.

It is not a de Polignac number, because 100000101197 - 216 = 100000035661 is a prime.

It is a congruent number.

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

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

Almost surely, 2100000101197 is an apocalyptic number.

It is an amenable number.

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

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

100000101197 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 20.

Adding to 100000101197 its reverse (791101000001), we get a palindrome (891101101198).

The spelling of 100000101197 in words is "one hundred billion, one hundred one thousand, one hundred ninety-seven".