Base | Representation |
---|---|
bin | 1010000111010100111101… |
… | …1000010011100100011100 |
3 | 1110101011020202110021222110 |
4 | 2201311033120103210130 |
5 | 2424201303014213040 |
6 | 35352530130314020 |
7 | 2225315541110130 |
oct | 241651730234434 |
9 | 43334222407873 |
10 | 11121002101020 |
11 | 35a8432842399 |
12 | 12b73a9128910 |
13 | 6289241029b6 |
14 | 2a638ba153c0 |
15 | 144439608980 |
hex | a1d4f61391c |
11121002101020 has 96 divisors (see below), whose sum is σ = 35587939968000. Its totient is φ = 2541890962944.
The previous prime is 11121002100997. The next prime is 11121002101031. The reversal of 11121002101020 is 2010120012111.
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 = 11121002100987 and 11121002101005.
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, 22370721 + ... + 22862439.
It is an arithmetic number, because the mean of its divisors is an integer number (370707708000).
Almost surely, 211121002101020 is an apocalyptic number.
11121002101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11121002101020 is an abundant number, since it is smaller than the sum of its proper divisors (24466937866980).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11121002101020 is a wasteful number, since it uses less digits than its factorization.
11121002101020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 545587 (or 545585 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 11121002101020 its reverse (2010120012111), we get a palindrome (13131122113131).
The spelling of 11121002101020 in words is "eleven trillion, one hundred twenty-one billion, two million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •