Search a number
-
+
106955237201 is a prime number
BaseRepresentation
bin110001110011100000…
…1110110011101010001
3101020001220011000000112
41203213001312131101
53223021020042301
6121045021531105
710504310341661
oct1434701663521
9336056130015
10106955237201
11413a549681a
121888b113a95
13a116772007
145268a881a1
152baeb609bb
hex18e7076751

106955237201 has 2 divisors, whose sum is σ = 106955237202. Its totient is φ = 106955237200.

The previous prime is 106955237173. The next prime is 106955237203. The reversal of 106955237201 is 102732559601.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 105469057600 + 1486179601 = 324760^2 + 38551^2 .

It is a cyclic number.

It is not a de Polignac number, because 106955237201 - 214 = 106955220817 is a prime.

It is a super-2 number, since 2×1069552372012 (a number of 23 digits) contains 22 as substring.

Together with 106955237203, 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 (106955237203) 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, 53477618600 + 53477618601.

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

Almost surely, 2106955237201 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 113400, while the sum is 41.

The spelling of 106955237201 in words is "one hundred six billion, nine hundred fifty-five million, two hundred thirty-seven thousand, two hundred one".