Search a number
-
+
106620575177647 is a prime number
BaseRepresentation
bin11000001111100010001001…
…100000100101101110101111
3111222111211100012112110022201
4120033202021200211232233
5102433332414221141042
61014432452133322331
731313040150502216
oct3017421140455657
9458454305473281
10106620575177647
1130a77594105673
12bb5b946a963a7
13476537aa2536b
141c4866b6d207d
15c4d6a4aa91b7
hex60f889825baf

106620575177647 has 2 divisors, whose sum is σ = 106620575177648. Its totient is φ = 106620575177646.

The previous prime is 106620575177609. The next prime is 106620575177693. The reversal of 106620575177647 is 746771575026601.

It is a happy number.

It is a weak prime.

It is an emirp because it is prime and its reverse (746771575026601) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 106620575177647 - 211 = 106620575175599 is a prime.

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

It is a congruent number.

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

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

Almost surely, 2106620575177647 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 103723200, while the sum is 64.

The spelling of 106620575177647 in words is "one hundred six trillion, six hundred twenty billion, five hundred seventy-five million, one hundred seventy-seven thousand, six hundred forty-seven".