106401969267 has 32 divisors (see below), whose sum is σ = 160357916160. Its totient is φ = 62163360000.

The previous prime is 106401969251. The next prime is 106401969277. The reversal of 106401969267 is 762969104601.

It is not a de Polignac number, because 106401969267 - 2⁴ = 106401969251 is a prime.

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

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

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

Almost surely, 2^106401969267 is an apocalyptic number.

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

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

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

The sum of its prime factors is 176875.

The product of its (nonzero) digits is 979776, while the sum is 51.

The spelling of 106401969267 in words is "one hundred six billion, four hundred one million, nine hundred sixty-nine thousand, two hundred sixty-seven".