Search a number
-
+
107069563200 = 26352172389641
BaseRepresentation
bin110001110110111010…
…1111110000101000000
3101020100212021100210210
41203231311332011000
53223234302010300
6121104224154120
710510166161635
oct1435565760500
9336325240723
10107069563200
1141453a82616
1218901468940
13a134360432
145279d2818c
152bb9be5050
hex18edd7e140

107069563200 has 672 divisors, whose sum is σ = 393085198080. Its totient is φ = 25375539200.

The previous prime is 107069563151. The next prime is 107069563219. The reversal of 107069563200 is 2365960701.

It is a super-2 number, since 2×1070695632002 (a number of 23 digits) 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 (19) of ones.

It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 167034880 + ... + 167035520.

Almost surely, 2107069563200 is an apocalyptic number.

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

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 107069563200, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (196542599040).

107069563200 is an abundant number, since it is smaller than the sum of its proper divisors (286015634880).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 68040, while the sum is 39.

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