Search a number
-
+
110100001113 = 341359259273
BaseRepresentation
bin110011010001001111…
…0001011000101011001
3101112012001120120010000
41212202132023011121
53300441100013423
6122325041043213
710645244365614
oct1464236130531
9345161516100
10110100001113
1142769642463
1219408326509
13a4c814106b
1454865b517b
152ce5c9c843
hex19a278b159

110100001113 has 10 divisors (see below), whose sum is σ = 164470372154. Its totient is φ = 73400000688.

The previous prime is 110100001093. The next prime is 110100001163. The reversal of 110100001113 is 311100001011.

It can be written as a sum of positive squares in only one way, i.e., 91952678169 + 18147322944 = 303237^2 + 134712^2 .

It is not a de Polignac number, because 110100001113 - 26 = 110100001049 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 679629556 + ... + 679629717.

Almost surely, 2110100001113 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 1359259285 (or 1359259276 counting only the distinct ones).

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

Adding to 110100001113 its reverse (311100001011), we get a palindrome (421200002124).

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

Divisors: 1 3 9 27 81 1359259273 4077777819 12233333457 36700000371 110100001113