Base | Representation |
---|---|
bin | 1010000001100100100110… |
… | …0011000010001010101100 |
3 | 1110000201000111100012212220 |
4 | 2200121021203002022230 |
5 | 2421041300210032340 |
6 | 35235254135555340 |
7 | 2215215260122605 |
oct | 240311143021254 |
9 | 43021014305786 |
10 | 11022120002220 |
11 | 356a500438a88 |
12 | 12a01b182bb50 |
13 | 61c4c60a0c72 |
14 | 2a168b232dac |
15 | 141a9d5dded0 |
hex | a06498c22ac |
11022120002220 has 96 divisors (see below), whose sum is σ = 31075626516480. Its totient is φ = 2918925722880.
The previous prime is 11022120002209. The next prime is 11022120002291. The reversal of 11022120002220 is 2220002122011.
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 11022120002220.
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, 7102549 + ... + 8514131.
It is an arithmetic number, because the mean of its divisors is an integer number (323704442880).
Almost surely, 211022120002220 is an apocalyptic number.
11022120002220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11022120002220 is an abundant number, since it is smaller than the sum of its proper divisors (20053506514260).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022120002220 is a wasteful number, since it uses less digits than its factorization.
11022120002220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1412495 (or 1412493 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 11022120002220 its reverse (2220002122011), we get a palindrome (13242122124231).
The spelling of 11022120002220 in words is "eleven trillion, twenty-two billion, one hundred twenty million, two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •