Search a number
-
+
106404765 = 357093651
BaseRepresentation
bin1100101011110…
…01101110011101
321102012220220020
412111321232131
5204214423030
614320342353
72431265655
oct625715635
9242186806
10106404765
1155076525
122b7749b9
1319076acc
14101bb365
15951c510
hex6579b9d

106404765 has 8 divisors (see below), whose sum is σ = 170247648. Its totient is φ = 56749200.

The previous prime is 106404733. The next prime is 106404773. The reversal of 106404765 is 567404601.

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

It is not a de Polignac number, because 106404765 - 25 = 106404733 is a prime.

It is a super-2 number, since 2×1064047652 = 22643948029410450, which contains 22 as substring.

It is a congruent number.

It is an unprimeable number.

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

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

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

Almost surely, 2106404765 is an apocalyptic number.

106404765 is a gapful number since it is divisible by the number (15) formed by its first and last digit.

It is an amenable number.

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

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

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

The sum of its prime factors is 7093659.

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

The square root of 106404765 is about 10315.2685374643. The cubic root of 106404765 is about 473.8639740354.

The spelling of 106404765 in words is "one hundred six million, four hundred four thousand, seven hundred sixty-five".

Divisors: 1 3 5 15 7093651 21280953 35468255 106404765