Search a number
-
+
106761556049 is a prime number
BaseRepresentation
bin110001101101101111…
…1000001000001010001
3101012120101200222102112
41203123133001001101
53222121424243144
6121013502355105
710466436152621
oct1433337010121
9335511628375
10106761556049
114130612a255
121883628ba95
13a0b55bab95
14524b06c881
152b9cb5399e
hex18db7c1051

106761556049 has 2 divisors, whose sum is σ = 106761556050. Its totient is φ = 106761556048.

The previous prime is 106761556039. The next prime is 106761556067. The reversal of 106761556049 is 940655167601.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 106753799824 + 7756225 = 326732^2 + 2785^2 .

It is a cyclic number.

It is not a de Polignac number, because 106761556049 - 228 = 106493120593 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 106761555988 and 106761556006.

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

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

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

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

Almost surely, 2106761556049 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1360800, while the sum is 50.

The spelling of 106761556049 in words is "one hundred six billion, seven hundred sixty-one million, five hundred fifty-six thousand, forty-nine".