106550050050301 has 32 divisors (see below), whose sum is σ = 126021599625600. Its totient is φ = 88809866745600.

The previous prime is 106550050050287. The next prime is 106550050050343. The reversal of 106550050050301 is 103050050055601.

It is not a de Polignac number, because 106550050050301 - 2⁷ = 106550050050173 is a prime.

It is a super-2 number, since 2×106550050050301² (a number of 29 digits) contains 22 as substring.

It is a Duffinian number.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (106550050050001) 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 31 ways as a sum of consecutive naturals, for example, 1049382906 + ... + 1049484436.

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

Almost surely, 2^{106550050050301} is an apocalyptic number.

106550050050301 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

106550050050301 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 150957.

The product of its (nonzero) digits is 11250, while the sum is 31.

The spelling of 106550050050301 in words is "one hundred six trillion, five hundred fifty billion, fifty million, fifty thousand, three hundred one".