106276731 has 16 divisors (see below), whose sum is σ = 155046528. Its totient is φ = 64217600.

The previous prime is 106276717. The next prime is 106276757. The reversal of 106276731 is 137672601.

It is a cyclic number.

It is not a de Polignac number, because 106276731 - 2⁵ = 106276699 is a prime.

It is a super-2 number, since 2×106276731² = 22589487104092722, which contains 22 as substring.

It is a Harshad number since it is a multiple of its sum of digits (33).

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

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

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

Almost surely, 2^106276731 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 9642.

The product of its (nonzero) digits is 10584, while the sum is 33.

The square root of 106276731 is about 10309.0606264586. The cubic root of 106276731 is about 473.6738351483.

The spelling of 106276731 in words is "one hundred six million, two hundred seventy-six thousand, seven hundred thirty-one".