Base | Representation |
---|---|
bin | 10000000000100000110… |
… | …001111001101110000000 |
3 | 10220011110011221100211102 |
4 | 100000200301321232000 |
5 | 121010411231031120 |
6 | 2201210013233532 |
7 | 142322360102354 |
oct | 20004061715600 |
9 | 3804404840742 |
10 | 1100061580160 |
11 | 3945960a1094 |
12 | 1592484928a8 |
13 | 7c97378953a |
14 | 3b359737464 |
15 | 1d9360b6d75 |
hex | 10020c79b80 |
1100061580160 has 32 divisors (see below), whose sum is σ = 2629834716600. Its totient is φ = 440024631808.
The previous prime is 1100061580147. The next prime is 1100061580169. The reversal of 1100061580160 is 610851600011.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×11000615801602 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1100061580169) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 859422470 + ... + 859423749.
Almost surely, 21100061580160 is an apocalyptic number.
1100061580160 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1100061580160 is an abundant number, since it is smaller than the sum of its proper divisors (1529773136440).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1100061580160 is an equidigital number, since it uses as much as digits as its factorization.
1100061580160 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1718846238 (or 1718846226 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 29.
The spelling of 1100061580160 in words is "one trillion, one hundred billion, sixty-one million, five hundred eighty thousand, one hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.141 sec. • engine limits •