Base | Representation |
---|---|
bin | 1010001101001001111001… |
… | …1001010101110010011000 |
3 | 1110201201122120221002212221 |
4 | 2203102132121111302120 |
5 | 2432321314134120440 |
6 | 35510524021313424 |
7 | 2235461421302362 |
oct | 243223631256230 |
9 | 43651576832787 |
10 | 11221112020120 |
11 | 3636935224322 |
12 | 1312887865874 |
13 | 6351b9619a12 |
14 | 2ab1674c9d32 |
15 | 146d48306d4a |
hex | a349e655c98 |
11221112020120 has 16 divisors (see below), whose sum is σ = 25247502045360. Its totient is φ = 4488444808032.
The previous prime is 11221112020103. The next prime is 11221112020147. The reversal of 11221112020120 is 2102021112211.
It is a junction number, because it is equal to n+sod(n) for n = 11221112020094 and 11221112020103.
It is a congruent number.
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, 140263900212 + ... + 140263900291.
It is an arithmetic number, because the mean of its divisors is an integer number (1577968877835).
Almost surely, 211221112020120 is an apocalyptic number.
11221112020120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11221112020120 is an abundant number, since it is smaller than the sum of its proper divisors (14026390025240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11221112020120 is a wasteful number, since it uses less digits than its factorization.
11221112020120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 280527800514 (or 280527800510 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 11221112020120 its reverse (2102021112211), we get a palindrome (13323133132331).
The spelling of 11221112020120 in words is "eleven trillion, two hundred twenty-one billion, one hundred twelve million, twenty thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •