Search a number
-
+
107029599597 = 32371743118439
BaseRepresentation
bin110001110101101110…
…1100001010101101101
3101020021002002000001100
41203223131201111231
53223144034141342
6121100235433313
710506202404654
oct1435335412555
9336232060040
10107029599597
1141433467348
12188abbb5839
13a128caa32b
1452748c419b
152bb644de4c
hex18eb76156d

107029599597 has 24 divisors (see below), whose sum is σ = 158794363520. Its totient is φ = 69416857440.

The previous prime is 107029599559. The next prime is 107029599613. The reversal of 107029599597 is 795995920701.

107029599597 is a `hidden beast` number, since 10 + 7 + 0 + 29 + 5 + 9 + 9 + 597 = 666.

It is not a de Polignac number, because 107029599597 - 26 = 107029599533 is a prime.

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

It is a Duffinian number.

It is a congruent number.

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

It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5795304 + ... + 5813742.

Almost surely, 2107029599597 is an apocalyptic number.

It is an amenable number.

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

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

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

The sum of its prime factors is 35913 (or 35910 counting only the distinct ones).

The product of its (nonzero) digits is 16074450, while the sum is 63.

The spelling of 107029599597 in words is "one hundred seven billion, twenty-nine million, five hundred ninety-nine thousand, five hundred ninety-seven".

Divisors: 1 3 9 37 111 333 17431 18439 52293 55317 156879 165951 644947 682243 1934841 2046729 5804523 6140187 321410209 964230627 2892691881 11892177733 35676533199 107029599597