Search a number
-
+
10111010113 = 19532158427
BaseRepresentation
bin10010110101010100…
…11100010101000001
3222002122122112101001
421122222130111001
5131201404310423
64351150012001
7505363111411
oct113252342501
928078575331
1010111010113
114319446606
121b621a7001
13c519b7529
146bcbbc641
153e29d9cad
hex25aa9c541

10111010113 has 4 divisors (see below), whose sum is σ = 10643168560. Its totient is φ = 9578851668.

The previous prime is 10111010099. The next prime is 10111010137. The reversal of 10111010113 is 31101011101.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-10111010113 is a prime.

It is a Duffinian number.

It is a self number, because there is not a number n which added to its sum of digits gives 10111010113.

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

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

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

Almost surely, 210111010113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 532158446.

The product of its (nonzero) digits is 3, while the sum is 10.

Adding to 10111010113 its reverse (31101011101), we get a palindrome (41212021214).

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

Divisors: 1 19 532158427 10111010113