Search a number
-
+
104872320000 = 21034547172
BaseRepresentation
bin110000110101011100…
…0001001110000000000
3101000200201202211210000
41201222320021300000
53204234303220000
6120102213440000
710401556004040
oct1415270116000
9330621684700
10104872320000
1140526766248
12183a9640000
139b74085826
14510c1a7720
152adbd70000
hex186ae09c00

104872320000 has 1650 divisors, whose sum is σ = 475097351432. Its totient is φ = 22560768000.

The previous prime is 104872319971. The next prime is 104872320011. The reversal of 104872320000 is 23278401.

It is a Harshad number since it is a multiple of its sum of digits (27).

It is a congruent number.

It is an unprimeable number.

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

It is a polite number, since it can be written in 149 ways as a sum of consecutive naturals, for example, 6168959992 + ... + 6168960008.

Almost surely, 2104872320000 is an apocalyptic number.

104872320000 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 104872320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (237548675716).

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

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

104872320000 is an frugal number, since it uses more digits than its factorization.

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

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

The product of its (nonzero) digits is 2688, while the sum is 27.

Adding to 104872320000 its reverse (23278401), we get a palindrome (104895598401).

The spelling of 104872320000 in words is "one hundred four billion, eight hundred seventy-two million, three hundred twenty thousand".