Search a number
-
+
106932702936601 is a prime number
BaseRepresentation
bin11000010100000100110101…
…110001011111111000011001
3112000121122222220222110202101
4120110010311301133320121
5103003441133422432401
61015232112222403401
731344430030616443
oct3024046561377031
9460548886873671
10106932702936601
11310879a5094753
12bbb0335a30561
1347889312cb1a9
141c597db3cb493
15c56871d23101
hex614135c5fe19

106932702936601 has 2 divisors, whose sum is σ = 106932702936602. Its totient is φ = 106932702936600.

The previous prime is 106932702936593. The next prime is 106932702936671. The reversal of 106932702936601 is 106639207239601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 69994557375625 + 36938145560976 = 8366275^2 + 6077676^2 .

It is a cyclic number.

It is not a de Polignac number, because 106932702936601 - 23 = 106932702936593 is a prime.

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

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

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

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

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

Almost surely, 2106932702936601 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 4408992, while the sum is 55.

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