Search a number
-
+
109152000000 = 2113256379
BaseRepresentation
bin110010110100111110…
…1110101100000000000
3101102201222202010001200
41211221331311200000
53242020403000000
6122051014101200
710612613456151
oct1455175654000
9342658663050
10109152000000
114232250516a
12191a294a800
13a3a690c064
1453d6721928
152c8c93d500
hex1969f75800

109152000000 has 504 divisors, whose sum is σ = 395098458300. Its totient is φ = 29030400000.

The previous prime is 109151999987. The next prime is 109152000019. The reversal of 109152000000 is 251901.

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

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 41 ways as a sum of consecutive naturals, for example, 287999811 + ... + 288000189.

Almost surely, 2109152000000 is an apocalyptic number.

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

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

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

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

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

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

The product of its (nonzero) digits is 90, while the sum is 18.

Adding to 109152000000 its reverse (251901), we get a palindrome (109152251901).

The spelling of 109152000000 in words is "one hundred nine billion, one hundred fifty-two million", and thus it is an aban number.