Base | Representation |
---|---|
bin | 110010111100011010… |
… | …0111111011101100000 |
3 | 101110101100220212220000 |
4 | 1211320310333131200 |
5 | 3243023220332434 |
6 | 122131442220000 |
7 | 10622032021164 |
oct | 1457064773540 |
9 | 343340825800 |
10 | 109401339744 |
11 | 42440227874 |
12 | 19252354600 |
13 | a416480078 |
14 | 541b8a8ca4 |
15 | 2ca4791b99 |
hex | 1978d3f760 |
109401339744 has 240 divisors, whose sum is σ = 327362112000. Its totient is φ = 35836286976.
The previous prime is 109401339679. The next prime is 109401339763. The reversal of 109401339744 is 447933104901.
It is a super-2 number, since 2×1094013397442 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 109401339744.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 35879532 + ... + 35882580.
It is an arithmetic number, because the mean of its divisors is an integer number (1364008800).
Almost surely, 2109401339744 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 109401339744, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (163681056000).
109401339744 is an abundant number, since it is smaller than the sum of its proper divisors (217960772256).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109401339744 is a wasteful number, since it uses less digits than its factorization.
109401339744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3307 (or 3290 counting only the distinct ones).
The product of its (nonzero) digits is 326592, while the sum is 45.
The spelling of 109401339744 in words is "one hundred nine billion, four hundred one million, three hundred thirty-nine thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •