Search a number
-
+
106376707677601 is a prime number
BaseRepresentation
bin11000001011111111000001…
…110111111001110110100001
3111221122111212122210212122101
4120023333001313321312201
5102420333444131140401
61014124441310410401
731256314661113114
oct3013770167716641
9457574778725571
10106376707677601
11309931212813a9
12bb20628200a01
13474838531488a
141c3a93554057b
15c4718034c101
hex60bfc1df9da1

106376707677601 has 2 divisors, whose sum is σ = 106376707677602. Its totient is φ = 106376707677600.

The previous prime is 106376707677593. The next prime is 106376707677739. The reversal of 106376707677601 is 106776707673601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 61278445083025 + 45098262594576 = 7828055^2 + 6715524^2 .

It is a cyclic number.

It is not a de Polignac number, because 106376707677601 - 23 = 106376707677593 is a prime.

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

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

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

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

Almost surely, 2106376707677601 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 106376707677601 in words is "one hundred six trillion, three hundred seventy-six billion, seven hundred seven million, six hundred seventy-seven thousand, six hundred one".