Base | Representation |
---|---|
bin | 10001011101101100010… |
… | …100001101001111000000 |
3 | 11020201200221112210110210 |
4 | 101131230110031033000 |
5 | 124130312424041000 |
6 | 2315154020554120 |
7 | 152463631065435 |
oct | 21355424151700 |
9 | 4221627483423 |
10 | 1200113112000 |
11 | 422a68623890 |
12 | 17470b552940 |
13 | 89229b6c69a |
14 | 4212b56db8c |
15 | 2133ead0350 |
hex | 1176c50d3c0 |
1200113112000 has 896 divisors, whose sum is σ = 4619765329920. Its totient is φ = 271434240000.
The previous prime is 1200113111999. The next prime is 1200113112041. The reversal of 1200113112000 is 2113110021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 336070215 + ... + 336073785.
Almost surely, 21200113112000 is an apocalyptic number.
1200113112000 is a gapful number since it is divisible by the number (10) 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 1200113112000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2309882664960).
1200113112000 is an abundant number, since it is smaller than the sum of its proper divisors (3419652217920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200113112000 is a wasteful number, since it uses less digits than its factorization.
1200113112000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3698 (or 3678 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 1200113112000 its reverse (2113110021), we get a palindrome (1202226222021).
The spelling of 1200113112000 in words is "one trillion, two hundred billion, one hundred thirteen million, one hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •