Base | Representation |
---|---|
bin | 1010001100100000111101… |
… | …0010010110101010010011 |
3 | 1110200200021121121010122122 |
4 | 2203020033102112222103 |
5 | 2432131312001042321 |
6 | 35501505240124455 |
7 | 2234622152155160 |
oct | 243101722265223 |
9 | 43620247533578 |
10 | 11210121112211 |
11 | 363220513655a |
12 | 131071aa6672b |
13 | 634157556908 |
14 | 2aa803905067 |
15 | 1469034618ab |
hex | a320f496a93 |
11210121112211 has 8 divisors (see below), whose sum is σ = 12987067903584. Its totient is φ = 9477049550400.
The previous prime is 11210121112193. The next prime is 11210121112219. The reversal of 11210121112211 is 11221112101211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11210121112211 - 226 = 11210054003347 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11210121112211.
It is not an unprimeable number, because it can be changed into a prime (11210121112219) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10968806840 + ... + 10968807861.
It is an arithmetic number, because the mean of its divisors is an integer number (1623383487948).
Almost surely, 211210121112211 is an apocalyptic number.
11210121112211 is a deficient number, since it is larger than the sum of its proper divisors (1776946791373).
11210121112211 is an equidigital number, since it uses as much as digits as its factorization.
11210121112211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21937614781.
The product of its (nonzero) digits is 16, while the sum is 17.
Adding to 11210121112211 its reverse (11221112101211), we get a palindrome (22431233213422).
The spelling of 11210121112211 in words is "eleven trillion, two hundred ten billion, one hundred twenty-one million, one hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •