Search a number
-
+
106609239763 = 138200710751
BaseRepresentation
bin110001101001001100…
…1111110011011010011
3101012011210002111202121
41203102121332123103
53221313431133023
6120550421555111
710462606405045
oct1432231763323
9335153074677
10106609239763
1141238155824
12187b3275a97
13a08cb8a8c0
145234b3da95
152b8e5b7d5d
hex18d267e6d3

106609239763 has 4 divisors (see below), whose sum is σ = 114809950528. Its totient is φ = 98408529000.

The previous prime is 106609239731. The next prime is 106609239773. The reversal of 106609239763 is 367932906601.

It is a semiprime because it is the product of two primes.

It is a cyclic number.

It is not a de Polignac number, because 106609239763 - 25 = 106609239731 is a prime.

It is a super-2 number, since 2×1066092397632 (a number of 23 digits) contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 106609239763.

It is not an unprimeable number, because it can be changed into a prime (106609239773) 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, 4100355363 + ... + 4100355388.

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

Almost surely, 2106609239763 is an apocalyptic number.

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

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

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

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

The sum of its prime factors is 8200710764.

The product of its (nonzero) digits is 2204496, while the sum is 52.

The spelling of 106609239763 in words is "one hundred six billion, six hundred nine million, two hundred thirty-nine thousand, seven hundred sixty-three".

Divisors: 1 13 8200710751 106609239763