Base | Representation |
---|---|
bin | 10100110111011001… |
… | …01100100101000000 |
3 | 1001220200202122202100 |
4 | 22123230230211000 |
5 | 140420220320000 |
6 | 5051324150400 |
7 | 544412306661 |
oct | 123354544500 |
9 | 31820678670 |
10 | 11202120000 |
11 | 4829339615 |
12 | 2207698400 |
13 | 1096a74896 |
14 | 783a85368 |
15 | 4586b6a00 |
hex | 29bb2c940 |
11202120000 has 630 divisors, whose sum is σ = 42677587238. Its totient is φ = 2806272000.
The previous prime is 11202119993. The next prime is 11202120049. The reversal of 11202120000 is 2120211.
It can be written as a sum of positive squares in 15 ways, for example, as 9805752576 + 1396367424 = 99024^2 + 37368^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 89 ways as a sum of consecutive naturals, for example, 302759982 + ... + 302760018.
Almost surely, 211202120000 is an apocalyptic number.
11202120000 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 11202120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (21338793619).
11202120000 is an abundant number, since it is smaller than the sum of its proper divisors (31475467238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11202120000 is an equidigital number, since it uses as much as digits as its factorization.
11202120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 133 (or 76 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 9.
Adding to 11202120000 its reverse (2120211), we get a palindrome (11204240211).
The spelling of 11202120000 in words is "eleven billion, two hundred two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •