Base | Representation |
---|---|
bin | 110010110010101100… |
… | …1010010110010000000 |
3 | 101102112122102221112220 |
4 | 1211211121102302000 |
5 | 3241341234433434 |
6 | 122035234251040 |
7 | 10610662565220 |
oct | 1454531226200 |
9 | 342478387486 |
10 | 109075311744 |
11 | 42293196143 |
12 | 19181126a80 |
13 | a393a6b1a9 |
14 | 53ca47c080 |
15 | 2c85d40d49 |
hex | 1965652c80 |
109075311744 has 64 divisors (see below), whose sum is σ = 331121490240. Its totient is φ = 31164374016.
The previous prime is 109075311743. The next prime is 109075311749. The reversal of 109075311744 is 447113570901.
It is a tau number, because it is divible by the number of its divisors (64).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a junction number, because it is equal to n+sod(n) for n = 109075311696 and 109075311705.
It is not an unprimeable number, because it can be changed into a prime (109075311743) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20286619 + ... + 20291994.
It is an arithmetic number, because the mean of its divisors is an integer number (5173773285).
Almost surely, 2109075311744 is an apocalyptic number.
109075311744 is a gapful number since it is divisible by the number (14) formed by its first and last digit.
It is an amenable number.
109075311744 is an abundant number, since it is smaller than the sum of its proper divisors (222046178496).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109075311744 is an equidigital number, since it uses as much as digits as its factorization.
109075311744 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40578637 (or 40578625 counting only the distinct ones).
The product of its (nonzero) digits is 105840, while the sum is 42.
The spelling of 109075311744 in words is "one hundred nine billion, seventy-five million, three hundred eleven thousand, seven hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •