Search a number
-
+
110709434561 = 1129347051519
BaseRepresentation
bin110011100011011001…
…0111110100011000001
3101120202112022222122012
41213012302332203001
53303213103401221
6122505331222305
710666324444535
oct1470662764301
9346675288565
10110709434561
1142a51653870
1219558447995
13a59449067b
1455034d5bc5
152d2e53065b
hex19c6cbe8c1

110709434561 has 8 divisors (see below), whose sum is σ = 124938547200. Its totient is φ = 97174425040.

The previous prime is 110709434531. The next prime is 110709434609. The reversal of 110709434561 is 165434907011.

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

It is not a de Polignac number, because 110709434561 - 210 = 110709433537 is a prime.

It is a Duffinian number.

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

It is a pernicious number, because its binary representation contains a prime number (19) of ones.

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

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

Almost surely, 2110709434561 is an apocalyptic number.

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

It is an amenable number.

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

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

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

The sum of its prime factors is 347051559.

The product of its (nonzero) digits is 90720, while the sum is 41.

The spelling of 110709434561 in words is "one hundred ten billion, seven hundred nine million, four hundred thirty-four thousand, five hundred sixty-one".

Divisors: 1 11 29 319 347051519 3817566709 10064494051 110709434561