Search a number
-
+
106947062773 is a prime number
BaseRepresentation
bin110001110011010001…
…0101010101111110101
3101020001022202200210221
41203212202222233311
53223011422002043
6121044130414341
710504151014555
oct1434642525765
9336038680727
10106947062773
11413a09131a1
12188884313b1
13a114b6c385
14526795b165
152bae0988ed
hex18e68aabf5

106947062773 has 2 divisors, whose sum is σ = 106947062774. Its totient is φ = 106947062772.

The previous prime is 106947062741. The next prime is 106947062813. The reversal of 106947062773 is 377260749601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 94622066449 + 12324996324 = 307607^2 + 111018^2 .

It is a cyclic number.

It is not a de Polignac number, because 106947062773 - 25 = 106947062741 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 106947062773.

It is a congruent number.

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

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

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

Almost surely, 2106947062773 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2667168, while the sum is 52.

The spelling of 106947062773 in words is "one hundred six billion, nine hundred forty-seven million, sixty-two thousand, seven hundred seventy-three".