Search a number
-
+
109093051 = 433251947
BaseRepresentation
bin1101000000010…
…10000010111011
321121021111112101
412200022002323
5210411434201
614454124231
72463163354
oct640120273
9247244471
10109093051
1156642251
1230650677
13197a8602
14106bad2b
15989dd01
hex680a0bb

109093051 has 4 divisors (see below), whose sum is σ = 109345432. Its totient is φ = 108840672.

The previous prime is 109093043. The next prime is 109093067. The reversal of 109093051 is 150390901.

It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 150390901 = 389386609.

It is a cyclic number.

It is not a de Polignac number, because 109093051 - 23 = 109093043 is a prime.

It is a Duffinian number.

It is not an unprimeable number, because it can be changed into a prime (109093031) 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 3 ways as a sum of consecutive naturals, for example, 125541 + ... + 126406.

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

Almost surely, 2109093051 is an apocalyptic number.

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

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

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

The sum of its prime factors is 252380.

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

The square root of 109093051 is about 10444.7618929299. The cubic root of 109093051 is about 477.8215094858.

The spelling of 109093051 in words is "one hundred nine million, ninety-three thousand, fifty-one".

Divisors: 1 433 251947 109093051