Base | Representation |
---|---|
bin | 11101010001011100110… |
… | …010011010111101000000 |
3 | 21010022021221221211212011 |
4 | 131101130302122331000 |
5 | 230424224430303000 |
6 | 4140041131342304 |
7 | 265222233625231 |
oct | 35213462327500 |
9 | 7108257854764 |
10 | 2011601416000 |
11 | 70612a6143a0 |
12 | 285a412b1994 |
13 | 117901c61c77 |
14 | 6d50d595088 |
15 | 374d67692ba |
hex | 1d45cc9af40 |
2011601416000 has 448 divisors, whose sum is σ = 5508707263488. Its totient is φ = 721593600000.
The previous prime is 2011601415991. The next prime is 2011601416031. The reversal of 2011601416000 is 6141061102.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2432407587 + ... + 2432408413.
Almost surely, 22011601416000 is an apocalyptic number.
2011601416000 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 2011601416000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2754353631744).
2011601416000 is an abundant number, since it is smaller than the sum of its proper divisors (3497105847488).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2011601416000 is a wasteful number, since it uses less digits than its factorization.
2011601416000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1207 (or 1187 counting only the distinct ones).
The product of its (nonzero) digits is 288, while the sum is 22.
Adding to 2011601416000 its reverse (6141061102), we get a palindrome (2017742477102).
The spelling of 2011601416000 in words is "two trillion, eleven billion, six hundred one million, four hundred sixteen thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •