Base | Representation |
---|---|
bin | 1010001100000010110001… |
… | …1011000100010101100000 |
3 | 1110122220101000221001102010 |
4 | 2203000230123010111200 |
5 | 2432013214110013440 |
6 | 35454045325152520 |
7 | 2234214332644404 |
oct | 243005433042540 |
9 | 43586330831363 |
10 | 11202020001120 |
11 | 3629828288923 |
12 | 130b0399bb740 |
13 | 6334660a1360 |
14 | 2aa275a3b104 |
15 | 1465cc142580 |
hex | a302c6c4560 |
11202020001120 has 192 divisors, whose sum is σ = 38376945319104. Its totient is φ = 2730118963200.
The previous prime is 11202020001023. The next prime is 11202020001143. The reversal of 11202020001120 is 2110002020211.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 11202020001096 and 11202020001105.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 8256867 + ... + 9517346.
It is an arithmetic number, because the mean of its divisors is an integer number (199879923537).
Almost surely, 211202020001120 is an apocalyptic number.
11202020001120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11202020001120 is an abundant number, since it is smaller than the sum of its proper divisors (27174925317984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11202020001120 is a wasteful number, since it uses less digits than its factorization.
11202020001120 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17774345 (or 17774337 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 11202020001120 its reverse (2110002020211), we get a palindrome (13312022021331).
The spelling of 11202020001120 in words is "eleven trillion, two hundred two billion, twenty million, one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •