Search a number
-
+
109670433 = 336556811
BaseRepresentation
bin1101000100101…
…11000000100001
321122100211112220
412202113000201
5211033423213
614514341253
72501116605
oct642270041
9248324486
10109670433
11569a7024
123088a829
131994b362
14107cb505
159964e23
hex6897021

109670433 has 4 divisors (see below), whose sum is σ = 146227248. Its totient is φ = 73113620.

The previous prime is 109670423. The next prime is 109670437. The reversal of 109670433 is 334076901.

It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.

It is a cyclic number.

It is not a de Polignac number, because 109670433 - 29 = 109669921 is a prime.

It is a Curzon number.

It is a junction number, because it is equal to n+sod(n) for n = 109670394 and 109670403.

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

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

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

Almost surely, 2109670433 is an apocalyptic number.

It is an amenable number.

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

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

109670433 is an evil number, because the sum of its binary digits is even.

The sum of its prime factors is 36556814.

The product of its (nonzero) digits is 13608, while the sum is 33.

The square root of 109670433 is about 10472.3652056257. The cubic root of 109670433 is about 478.6629937305.

The spelling of 109670433 in words is "one hundred nine million, six hundred seventy thousand, four hundred thirty-three".

Divisors: 1 3 36556811 109670433