Search a number
-
+
107405608229709 = 335801869409903
BaseRepresentation
bin11000011010111101010001…
…001000000001101101001101
3112002021212122111201110112020
4120122331101020001231031
5103034213141201322314
61020233242200200353
731423541045364426
oct3032752110015515
9462255574643466
10107405608229709
113124a50a8728a9
1210067b14a690b9
1347c13c7c58c0a
141c7465dd9864d
15c63cede14da9
hex61af51201b4d

107405608229709 has 4 divisors (see below), whose sum is σ = 143207477639616. Its totient is φ = 71603738819804.

The previous prime is 107405608229707. The next prime is 107405608229749. The reversal of 107405608229709 is 907922806504701.

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 107405608229709 - 21 = 107405608229707 is a prime.

It is a congruent number.

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

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

Almost surely, 2107405608229709 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35801869409906.

The product of its (nonzero) digits is 15240960, while the sum is 60.

The spelling of 107405608229709 in words is "one hundred seven trillion, four hundred five billion, six hundred eight million, two hundred twenty-nine thousand, seven hundred nine".

Divisors: 1 3 35801869409903 107405608229709