Search a number
-
+
109719093000 = 233531129114649
BaseRepresentation
bin110011000101111000…
…1000111111100001000
3101111012111211102102010
41212023301013330020
53244201041434000
6122223152535520
710632640621416
oct1461361077410
9344174742363
10109719093000
1142593627570
12193208515a0
13a46725574a
14544bb802b6
152cc260ad50
hex198bc47f08

109719093000 has 256 divisors, whose sum is σ = 386324640000. Its totient is φ = 25681152000.

The previous prime is 109719092993. The next prime is 109719093047. The reversal of 109719093000 is 390917901.

It is a self number, because there is not a number n which added to its sum of digits gives 109719093000.

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, 899676 + ... + 1014324.

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

Almost surely, 2109719093000 is an apocalyptic number.

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

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

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

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

109719093000 is an evil number, because the sum of its binary digits is even.

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

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

The spelling of 109719093000 in words is "one hundred nine billion, seven hundred nineteen million, ninety-three thousand".