Base | Representation |
---|---|
bin | 110010110010100000… |
… | …0101000011011101000 |
3 | 101102112012021111100102 |
4 | 1211211000220123220 |
5 | 3241333111044244 |
6 | 122034443524532 |
7 | 10610553621110 |
oct | 1454500503350 |
9 | 342465244312 |
10 | 109068846824 |
11 | 4228a57aa33 |
12 | 1917ab29748 |
13 | a3926166b2 |
14 | 53c9678040 |
15 | 2c854b554e |
hex | 19650286e8 |
109068846824 has 16 divisors (see below), whose sum is σ = 233718957600. Its totient is φ = 46743791472.
The previous prime is 109068846791. The next prime is 109068846833. The reversal of 109068846824 is 428648860901.
It is a Harshad number since it is a multiple of its sum of digits (56), and also a Moran number because the ratio is a prime number: 1947657979 = 109068846824 / (1 + 0 + 9 + 0 + 6 + 8 + 8 + 4 + 6 + 8 + 2 + 4).
It is a self number, because there is not a number n which added to its sum of digits gives 109068846824.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 973828934 + ... + 973829045.
It is an arithmetic number, because the mean of its divisors is an integer number (14607434850).
Almost surely, 2109068846824 is an apocalyptic number.
109068846824 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
109068846824 is an abundant number, since it is smaller than the sum of its proper divisors (124650110776).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109068846824 is a wasteful number, since it uses less digits than its factorization.
109068846824 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1947657992 (or 1947657988 counting only the distinct ones).
The product of its (nonzero) digits is 5308416, while the sum is 56.
The spelling of 109068846824 in words is "one hundred nine billion, sixty-eight million, eight hundred forty-six thousand, eight hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •