Search a number
-
+
106560051101 = 724416236323
BaseRepresentation
bin110001100111101111…
…0010101011110011101
3101012001100112110121022
41203033132111132131
53221213333113401
6120541503413525
710461441326630
oct1431736253635
9335040473538
10106560051101
1141212409639
121879a8b42a5
13a08292789a
14522c3b7c17
152b8a0ed71b
hex18cf79579d

106560051101 has 8 divisors (see below), whose sum is σ = 121832825664. Its totient is φ = 91299754080.

The previous prime is 106560051061. The next prime is 106560051113. The reversal of 106560051101 is 101150065601.

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-106560051101 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a congruent number.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3101075 + ... + 3135248.

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

Almost surely, 2106560051101 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 6238771.

The product of its (nonzero) digits is 900, while the sum is 26.

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

Divisors: 1 7 2441 17087 6236323 43654261 15222864443 106560051101