Search a number
-
+
109210428672 = 28341103151223
BaseRepresentation
bin110010110110101110…
…0101110010100000000
3101102220001200121010120
41211231130232110000
53242130332204142
6122100502300240
710614223220142
oct1455534562400
9342801617116
10109210428672
1142352492524
12191ba427680
13a3b5a58a37
1454003b0c92
152c92b307ec
hex196d72e500

109210428672 has 288 divisors, whose sum is σ = 303987081216. Its totient is φ = 34781184000.

The previous prime is 109210428641. The next prime is 109210428683. The reversal of 109210428672 is 276824012901.

It is a Smith number, since the sum of its digits (42) coincides with the sum of the digits of its prime factors.

It is a congruent number.

It is an unprimeable number.

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 489732753 + ... + 489732975.

Almost surely, 2109210428672 is an apocalyptic number.

109210428672 is a gapful number since it is divisible by the number (12) 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 109210428672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (151993540608).

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

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

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

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

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

The product of its (nonzero) digits is 96768, while the sum is 42.

The spelling of 109210428672 in words is "one hundred nine billion, two hundred ten million, four hundred twenty-eight thousand, six hundred seventy-two".