Search a number
-
+
109105295 = 5131678543
BaseRepresentation
bin1101000000011…
…01000010001111
321121022010022212
412200031002033
5210412332140
614454301035
72463244145
oct640150217
9247263285
10109105295
1156650472
123065777b
13197b1060
14106c1595
1598a2765
hex680d08f

109105295 has 8 divisors (see below), whose sum is σ = 140997696. Its totient is φ = 80570016.

The previous prime is 109105291. The next prime is 109105301. The reversal of 109105295 is 592501901.

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

It is a cyclic number.

It is not a de Polignac number, because 109105295 - 22 = 109105291 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 (109105291) by changing a digit.

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

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

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

Almost surely, 2109105295 is an apocalyptic number.

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

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

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

The sum of its prime factors is 1678561.

The product of its (nonzero) digits is 4050, while the sum is 32.

The square root of 109105295 is about 10445.3480076061. The cubic root of 109105295 is about 477.8393848306.

The spelling of 109105295 in words is "one hundred nine million, one hundred five thousand, two hundred ninety-five".

Divisors: 1 5 13 65 1678543 8392715 21821059 109105295