Base | Representation |
---|---|
bin | 1010000001100100111001… |
… | …1100101011000111011100 |
3 | 1110000201020020001100212122 |
4 | 2200121032130223013130 |
5 | 2421041432232033040 |
6 | 35235310234122112 |
7 | 2215220306016554 |
oct | 240311634530734 |
9 | 43021206040778 |
10 | 11022202221020 |
11 | 356a542895201 |
12 | 12a0215280338 |
13 | 61c50a12a243 |
14 | 2a1698116164 |
15 | 141aa59301b5 |
hex | a064e72b1dc |
11022202221020 has 48 divisors (see below), whose sum is σ = 23171862974400. Its totient is φ = 4404076045824.
The previous prime is 11022202220989. The next prime is 11022202221083. The reversal of 11022202221020 is 2012220222011.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 11022202221020.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 73693352 + ... + 73842768.
It is an arithmetic number, because the mean of its divisors is an integer number (482747145300).
Almost surely, 211022202221020 is an apocalyptic number.
11022202221020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11022202221020 is an abundant number, since it is smaller than the sum of its proper divisors (12149660753380).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11022202221020 is a wasteful number, since it uses less digits than its factorization.
11022202221020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153422 (or 153420 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 17.
Adding to 11022202221020 its reverse (2012220222011), we get a palindrome (13034422443031).
The spelling of 11022202221020 in words is "eleven trillion, twenty-two billion, two hundred two million, two hundred twenty-one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •