Base | Representation |
---|---|
bin | 10000010100111100011… |
… | …111010101011001000100 |
3 | 10222021002012102011222020 |
4 | 100110330133111121010 |
5 | 121340324313430200 |
6 | 2215235034003140 |
7 | 144030144534162 |
oct | 20247437253104 |
9 | 3867065364866 |
10 | 1122001311300 |
11 | 3a29245428a1 |
12 | 16154bb764b0 |
13 | 81a5bc9907c |
14 | 3c43b4aa232 |
15 | 1e2bc28cea0 |
hex | 1053c7d5644 |
1122001311300 has 72 divisors (see below), whose sum is σ = 3246757152576. Its totient is φ = 299160408960.
The previous prime is 1122001311289. The next prime is 1122001311331. The reversal of 1122001311300 is 31131002211.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 1122001311300.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2036274 + ... + 2527926.
Almost surely, 21122001311300 is an apocalyptic number.
1122001311300 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1122001311300 is an abundant number, since it is smaller than the sum of its proper divisors (2124755841276).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1122001311300 is a wasteful number, since it uses less digits than its factorization.
1122001311300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 499277 (or 499270 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 1122001311300 its reverse (31131002211), we get a palindrome (1153132313511).
The spelling of 1122001311300 in words is "one trillion, one hundred twenty-two billion, one million, three hundred eleven thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •