Search a number
-
+
109295701 = 2313273581
BaseRepresentation
bin1101000001110…
…11100001010101
321121122210111221
412200323201111
5210434430301
614502330341
72464666234
oct640734125
9247583457
10109295701
1156770529
12307299b1
1319849918
1410730b1b
1598ddda1
hex683b855

109295701 has 8 divisors (see below), whose sum is σ = 114165504. Its totient is φ = 104435760.

The previous prime is 109295687. The next prime is 109295729. The reversal of 109295701 is 107592901.

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 109295701 - 27 = 109295573 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 (109295741) 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 7 ways as a sum of consecutive naturals, for example, 28731 + ... + 32311.

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

Almost surely, 2109295701 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 4931.

The product of its (nonzero) digits is 5670, while the sum is 34.

The square root of 109295701 is about 10454.4584269105. The cubic root of 109295701 is about 478.1171917275.

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

Divisors: 1 23 1327 3581 30521 82363 4751987 109295701