Search a number
-
+
110605105501 = 1121279971419
BaseRepresentation
bin110011100000010010…
…0111111100101011101
3101120111021000112001221
41213000210333211131
53303004401334001
6122451123133341
710663616612302
oct1470044774535
9346437015057
10110605105501
11429a8775900
1219529514251
13a5789925b7
1454d36d90a9
152d252c31a1
hex19c093f95d

110605105501 has 12 divisors (see below), whose sum is σ = 121585408000. Its totient is φ = 100540832040.

The previous prime is 110605105493. The next prime is 110605105519. The reversal of 110605105501 is 105501506011.

It is not a de Polignac number, because 110605105501 - 23 = 110605105493 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1512970 + ... + 1584388.

Almost surely, 2110605105501 is an apocalyptic number.

110605105501 is a gapful number since it is divisible by the number (11) formed by its first and last digit.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 750, while the sum is 25.

It can be divided in two parts, 11060510 and 5501, that added together give a palindrome (11066011).

The spelling of 110605105501 in words is "one hundred ten billion, six hundred five million, one hundred five thousand, five hundred one".

Divisors: 1 11 121 12799 71419 140789 785609 1548679 8641699 914091781 10055009591 110605105501