Search a number
-
+
106577053613 is a prime number
BaseRepresentation
bin110001101000001111…
…1001100011110101101
3101012002112112021122222
41203100133030132231
53221232211203423
6120543312045125
710462036002632
oct1432037143655
9335075467588
10106577053613
1141220a718a8
12187a45337a5
13a0862cb844
145230762189
152b8b85b3c8
hex18d07cc7ad

106577053613 has 2 divisors, whose sum is σ = 106577053614. Its totient is φ = 106577053612.

The previous prime is 106577053607. The next prime is 106577053657. The reversal of 106577053613 is 316350775601.

It is an a-pointer prime, because the next prime (106577053657) can be obtained adding 106577053613 to its sum of digits (44).

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 72212050729 + 34365002884 = 268723^2 + 185378^2 .

It is a cyclic number.

It is not a de Polignac number, because 106577053613 - 26 = 106577053549 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 2106577053613 is an apocalyptic number.

It is an amenable number.

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

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

106577053613 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 396900, while the sum is 44.

The spelling of 106577053613 in words is "one hundred six billion, five hundred seventy-seven million, fifty-three thousand, six hundred thirteen".