Search a number
-
+
109141561 = 401327197
BaseRepresentation
bin1101000000101…
…01111000111001
321121100222002001
412200111320321
5210420012221
614455141001
72463454654
oct640257071
9247328061
10109141561
1156675741
1230674761
13197c4709
14106d089b
1598ad391
hex6815e39

109141561 has 4 divisors (see below), whose sum is σ = 109172772. Its totient is φ = 109110352.

The previous prime is 109141537. The next prime is 109141609. The reversal of 109141561 is 165141901.

It is a semiprime because it is the product of two primes.

It can be written as a sum of positive squares in 2 ways, for example, as 77105961 + 32035600 = 8781^2 + 5660^2 .

It is a cyclic number.

It is not a de Polignac number, because 109141561 - 27 = 109141433 is a prime.

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 9586 + ... + 17611.

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

Almost surely, 2109141561 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 31210.

The product of its (nonzero) digits is 1080, while the sum is 28.

The square root of 109141561 is about 10447.0838514870. The cubic root of 109141561 is about 477.8923226935.

The spelling of 109141561 in words is "one hundred nine million, one hundred forty-one thousand, five hundred sixty-one".

Divisors: 1 4013 27197 109141561