Search a number
-
+
109454411136 = 27373137131271
BaseRepresentation
bin110010111101111111…
…1011100010110000000
3101110112001210012011010
41211323333130112000
53243130312124021
6122141015520520
710623245100240
oct1457377342600
9343461705133
10109454411136
1142468186124
1219268089140
13a424472465
145424961b20
152ca9276976
hex197bfdc580

109454411136 has 512 divisors, whose sum is σ = 356259594240. Its totient is φ = 29113344000.

The previous prime is 109454411123. The next prime is 109454411147. The reversal of 109454411136 is 631114454901.

It is a happy number.

It is a junction number, because it is equal to n+sod(n) for n = 109454411094 and 109454411103.

It is a congruent number.

It is an unprimeable number.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 403890681 + ... + 403890951.

It is an arithmetic number, because the mean of its divisors is an integer number (695819520).

Almost surely, 2109454411136 is an apocalyptic number.

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

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

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

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

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

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

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

The spelling of 109454411136 in words is "one hundred nine billion, four hundred fifty-four million, four hundred eleven thousand, one hundred thirty-six".