Search a number
-
+
10110201113 = 90711146859
BaseRepresentation
bin10010110101001110…
…10110110100011001
3222002121010102122002
421122213112310121
5131201202413423
64351120410345
7505353201665
oct113247266431
928077112562
1010110201113
114318a43811
121b61a769b5
13c5179322c
146bca4b8a5
153e28ca228
hex25a9d6d19

10110201113 has 4 divisors (see below), whose sum is σ = 10121348880. Its totient is φ = 10099053348.

The previous prime is 10110201077. The next prime is 10110201139. The reversal of 10110201113 is 31110201101.

It is a happy number.

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 not a de Polignac number, because 10110201113 - 212 = 10110197017 is a prime.

It is a Duffinian number.

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

It is not an unprimeable number, because it can be changed into a prime (10110201163) 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, 5572523 + ... + 5574336.

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

Almost surely, 210110201113 is an apocalyptic number.

It is an amenable number.

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

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

10110201113 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 11147766.

The product of its (nonzero) digits is 6, while the sum is 11.

Adding to 10110201113 its reverse (31110201101), we get a palindrome (41220402214).

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

Divisors: 1 907 11146859 10110201113