Search a number
-
+
110141141 = 1159169709
BaseRepresentation
bin1101001000010…
…01111011010101
321200020202020112
412210021323111
5211144004031
614532412405
72505120125
oct644117325
9250222215
10110141141
1157198740
1230a77105
1319a84696
14108b0c85
159a0962b
hex6909ed5

110141141 has 8 divisors (see below), whose sum is σ = 122191200. Its totient is φ = 98430640.

The previous prime is 110141137. The next prime is 110141153. The reversal of 110141141 is 141141011.

It is a sphenic number, since it is the product of 3 distinct primes.

It is not a de Polignac number, because 110141141 - 22 = 110141137 is a prime.

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 84206 + ... + 85503.

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

Almost surely, 2110141141 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 169779.

The product of its (nonzero) digits is 16, while the sum is 14.

The square root of 110141141 is about 10494.8149578732. The cubic root of 110141141 is about 479.3468271478.

Adding to 110141141 its reverse (141141011), we get a palindrome (251282152).

The spelling of 110141141 in words is "one hundred ten million, one hundred forty-one thousand, one hundred forty-one".

Divisors: 1 11 59 649 169709 1866799 10012831 110141141