Base | Representation |
---|---|
bin | 100000000010000000100… |
… | …000000001100000110000 |
3 | 21210102121221212202020010 |
4 | 200002000200001200300 |
5 | 242031003324242000 |
6 | 4403112512014520 |
7 | 315013161633360 |
oct | 40020040014060 |
9 | 7712557782203 |
10 | 2201179134000 |
11 | 7795732668a0 |
12 | 2b672a531440 |
13 | 12c754c50372 |
14 | 787753cc9a0 |
15 | 3c3cec19d50 |
hex | 20080801830 |
2201179134000 has 640 divisors, whose sum is σ = 8869510600704. Its totient is φ = 456261120000.
The previous prime is 2201179133963. The next prime is 2201179134029. The reversal of 2201179134000 is 4319711022.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 194496342 + ... + 194507658.
Almost surely, 22201179134000 is an apocalyptic number.
2201179134000 is a gapful number since it is divisible by the number (20) 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 2201179134000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (4434755300352).
2201179134000 is an abundant number, since it is smaller than the sum of its proper divisors (6668331466704).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2201179134000 is a wasteful number, since it uses less digits than its factorization.
2201179134000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11782 (or 11766 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 30.
The spelling of 2201179134000 in words is "two trillion, two hundred one billion, one hundred seventy-nine million, one hundred thirty-four thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •