Base | Representation |
---|---|
bin | 1010000110001010111001… |
… | …1100000111101111111101 |
3 | 1110022020221021201121200120 |
4 | 2201202232130013233331 |
5 | 2423340044224201341 |
6 | 35335441325045153 |
7 | 2224013103642126 |
oct | 241425634075775 |
9 | 43266837647616 |
10 | 11101122100221 |
11 | 359aa6102456a |
12 | 12b357b3b67b9 |
13 | 626aa655180a |
14 | 2a542364904d |
15 | 143b74193066 |
hex | a18ae707bfd |
11101122100221 has 8 divisors (see below), whose sum is σ = 15201536569824. Its totient is φ = 7200727848720.
The previous prime is 11101122100213. The next prime is 11101122100259. The reversal of 11101122100221 is 12200122110111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 11101122100221 - 23 = 11101122100213 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11101122100221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11101122100291) 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, 50005054395 + ... + 50005054616.
It is an arithmetic number, because the mean of its divisors is an integer number (1900192071228).
Almost surely, 211101122100221 is an apocalyptic number.
It is an amenable number.
11101122100221 is a deficient number, since it is larger than the sum of its proper divisors (4100414469603).
11101122100221 is a wasteful number, since it uses less digits than its factorization.
11101122100221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100010109051.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 11101122100221 its reverse (12200122110111), we get a palindrome (23301244210332).
The spelling of 11101122100221 in words is "eleven trillion, one hundred one billion, one hundred twenty-two million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •