106515211022535 has 128 divisors (see below), whose sum is σ = 195943158835200. Its totient is φ = 48400615065600.

The previous prime is 106515211022501. The next prime is 106515211022537. The reversal of 106515211022535 is 535220112515601.

It is not a de Polignac number, because 106515211022535 - 2¹⁴ = 106515211006151 is a prime.

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

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

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (106515211022537) 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 in 127 ways as a sum of consecutive naturals, for example, 35375359180 + ... + 35375362190.

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

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

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

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

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

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

The sum of its prime factors is 6089.

The product of its (nonzero) digits is 90000, while the sum is 39.

The spelling of 106515211022535 in words is "one hundred six trillion, five hundred fifteen billion, two hundred eleven million, twenty-two thousand, five hundred thirty-five".