Base | Representation |
---|---|
bin | 110011000100110101… |
… | …0110010001110000000 |
3 | 101111010001120020210001 |
4 | 1212021222302032000 |
5 | 3244113033023421 |
6 | 122215454045344 |
7 | 10632032366200 |
oct | 1461152621600 |
9 | 344101506701 |
10 | 109683876736 |
11 | 42575764015 |
12 | 19310aa9854 |
13 | a45cb75415 |
14 | 5447214400 |
15 | 2cbe4a1691 |
hex | 1989ab2380 |
109683876736 has 96 divisors (see below), whose sum is σ = 254402035200. Its totient is φ = 46967445504.
The previous prime is 109683876667. The next prime is 109683876751. The reversal of 109683876736 is 637678386901.
It is a Harshad number since it is a multiple of its sum of digits (64).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8077825 + ... + 8091391.
It is an arithmetic number, because the mean of its divisors is an integer number (2650021200).
Almost surely, 2109683876736 is an apocalyptic number.
109683876736 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 109683876736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (127201017600).
109683876736 is an abundant number, since it is smaller than the sum of its proper divisors (144718158464).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109683876736 is a wasteful number, since it uses less digits than its factorization.
109683876736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14884 (or 14865 counting only the distinct ones).
The product of its (nonzero) digits is 54867456, while the sum is 64.
The spelling of 109683876736 in words is "one hundred nine billion, six hundred eighty-three million, eight hundred seventy-six thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •