Search a number
-
+
107110236601 = 1759139976333
BaseRepresentation
bin110001111000001000…
…1001000000110111001
3101020110200210210020001
41203300101020012321
53223330210032401
6121112240033001
710511201663164
oct1436021100671
9336420723201
10107110236601
1141474a330a5
1218913002761
13a13c901634
1452814b4adb
152bbd57b601
hex18f04481b9

107110236601 has 16 divisors (see below), whose sum is σ = 115417008000. Its totient is φ = 99028862208.

The previous prime is 107110236581. The next prime is 107110236617. The reversal of 107110236601 is 106632011701.

It is a cyclic number.

It is not a de Polignac number, because 107110236601 - 219 = 107109712313 is a prime.

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

It is a Duffinian number.

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

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

It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1365031 + ... + 1441363.

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

Almost surely, 2107110236601 is an apocalyptic number.

It is an amenable number.

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

107110236601 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 77808.

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

The spelling of 107110236601 in words is "one hundred seven billion, one hundred ten million, two hundred thirty-six thousand, six hundred one".

Divisors: 1 17 59 1003 1399 23783 76333 82541 1297661 1403197 4503647 76561999 106789867 1815427739 6300602153 107110236601