Base | Representation |
---|---|
bin | 1010000110001110100111… |
… | …1111000011001000111000 |
3 | 1110022100111220112200101021 |
4 | 2201203221333003020320 |
5 | 2423344121001041440 |
6 | 35340124413232224 |
7 | 2224046624256223 |
oct | 241435177031070 |
9 | 43270456480337 |
10 | 11102121112120 |
11 | 35a0423a32a35 |
12 | 12b37b9a92674 |
13 | 626c0550400c |
14 | 2a54ba1ba5ba |
15 | 143bd1c2b84a |
hex | a18e9fc3238 |
11102121112120 has 32 divisors (see below), whose sum is σ = 24979925131920. Its totient is φ = 4440821310720.
The previous prime is 11102121112099. The next prime is 11102121112153. The reversal of 11102121112120 is 2121112120111.
It is a super-2 number, since 2×111021211121202 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11102121112094 and 11102121112103.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6584740 + ... + 8097100.
Almost surely, 211102121112120 is an apocalyptic number.
11102121112120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11102121112120 is an abundant number, since it is smaller than the sum of its proper divisors (13877804019800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11102121112120 is a wasteful number, since it uses less digits than its factorization.
11102121112120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1695895 (or 1695891 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 11102121112120 its reverse (2121112120111), we get a palindrome (13223233232231).
The spelling of 11102121112120 in words is "eleven trillion, one hundred two billion, one hundred twenty-one million, one hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •