10701001111 has 4 divisors (see below), whose sum is σ = 10701241992. Its totient is φ = 10700760232.

The previous prime is 10701001097. The next prime is 10701001123. The reversal of 10701001111 is 11110010701.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 10701001111 - 2⁹ = 10701000599 is a prime.

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

It is a Duffinian number.

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

It is a congruent number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 32305 + ... + 149818.

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

Almost surely, 2^10701001111 is an apocalyptic number.

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

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

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

The sum of its prime factors is 240880.

The product of its (nonzero) digits is 7, while the sum is 13.

Adding to 10701001111 its reverse (11110010701), we get a palindrome (21811011812).

The spelling of 10701001111 in words is "ten billion, seven hundred one million, one thousand, one hundred eleven".