Base | Representation |
---|---|
bin | 1010001100100000111101… |
… | …0010010110101000101110 |
3 | 1110200200021121121010111220 |
4 | 2203020033102112220232 |
5 | 2432131312001041420 |
6 | 35501505240124210 |
7 | 2234622152154654 |
oct | 243101722265056 |
9 | 43620247533456 |
10 | 11210121112110 |
11 | 3632205136478 |
12 | 131071aa66666 |
13 | 63415755685b |
14 | 2aa803904dd4 |
15 | 146903461840 |
hex | a320f496a2e |
11210121112110 has 64 divisors (see below), whose sum is σ = 27211497099840. Its totient is φ = 2955243709440.
The previous prime is 11210121112079. The next prime is 11210121112153. The reversal of 11210121112110 is 1121112101211.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 11210121112110.
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, 14525124 + ... + 15277416.
It is an arithmetic number, because the mean of its divisors is an integer number (425179642185).
Almost surely, 211210121112110 is an apocalyptic number.
11210121112110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11210121112110 is an abundant number, since it is smaller than the sum of its proper divisors (16001375987730).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11210121112110 is a wasteful number, since it uses less digits than its factorization.
11210121112110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 757973.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 11210121112110 its reverse (1121112101211), we get a palindrome (12331233213321).
The spelling of 11210121112110 in words is "eleven trillion, two hundred ten billion, one hundred twenty-one million, one hundred twelve thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •