Search a number
-
+
106511556561 = 335503852187
BaseRepresentation
bin110001100110010010…
…1010101111111010001
3101011220222021200121020
41203030211111333101
53221113424302221
6120533012150053
710460312202264
oct1431445257721
9334828250536
10106511556561
1141197aa6a03
1218786608329
13a0758787a7
145225b92cdb
152b85c1eac6
hex18cc955fd1

106511556561 has 4 divisors (see below), whose sum is σ = 142015408752. Its totient is φ = 71007704372.

The previous prime is 106511556539. The next prime is 106511556601. The reversal of 106511556561 is 165655115601.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 106511556561 - 27 = 106511556433 is a prime.

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

It is a Curzon number.

It is not an unprimeable number, because it can be changed into a prime (106511556511) by changing a digit.

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17751926091 + ... + 17751926096.

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

Almost surely, 2106511556561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35503852190.

The product of its (nonzero) digits is 135000, while the sum is 42.

The spelling of 106511556561 in words is "one hundred six billion, five hundred eleven million, five hundred fifty-six thousand, five hundred sixty-one".

Divisors: 1 3 35503852187 106511556561