Base | Representation |
---|---|
bin | 1010000000010011000000… |
… | …1101100111110000001000 |
3 | 1102221121111020212001002112 |
4 | 2200010300031213300020 |
5 | 2420211422322401440 |
6 | 35221233101321452 |
7 | 2213511465165635 |
oct | 240046015476010 |
9 | 42847436761075 |
10 | 11000220122120 |
11 | 3561192535a19 |
12 | 1297abb566288 |
13 | 61a415c05228 |
14 | 2a05b08b518c |
15 | 14121ab8a965 |
hex | a0130367c08 |
11000220122120 has 16 divisors (see below), whose sum is σ = 24750495274860. Its totient is φ = 4400088048832.
The previous prime is 11000220122117. The next prime is 11000220122141. The reversal of 11000220122120 is 2122102200011.
It can be written as a sum of positive squares in 2 ways, for example, as 9235727653156 + 1764492468964 = 3039034^2 + 1328342^2 .
It is a junction number, because it is equal to n+sod(n) for n = 11000220122095 and 11000220122104.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 137502751487 + ... + 137502751566.
Almost surely, 211000220122120 is an apocalyptic number.
11000220122120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11000220122120 is an abundant number, since it is smaller than the sum of its proper divisors (13750275152740).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11000220122120 is a wasteful number, since it uses less digits than its factorization.
11000220122120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275005503064 (or 275005503060 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 11000220122120 its reverse (2122102200011), we get a palindrome (13122322322131).
The spelling of 11000220122120 in words is "eleven trillion, two hundred twenty million, one hundred twenty-two thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •