Base | Representation |
---|---|
bin | 1100110111101111010… |
… | …1101101100110111111 |
3 | 210010202022012011112011 |
4 | 3031323311231212333 |
5 | 12110323434310421 |
6 | 245325342352051 |
7 | 21655404400651 |
oct | 3157365554677 |
9 | 703668164464 |
10 | 221121010111 |
11 | 85860055761 |
12 | 36a30b8b627 |
13 | 17b0c0228b1 |
14 | a9b92146d1 |
15 | 5b428264e1 |
hex | 337bd6d9bf |
221121010111 has 8 divisors (see below), whose sum is σ = 222074455680. Its totient is φ = 220168418712.
The previous prime is 221121010073. The next prime is 221121010147. The reversal of 221121010111 is 111010121122.
It is a happy number.
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 221121010111 - 229 = 220584139199 is a prime.
It is a super-2 number, since 2×2211210101112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221121010091 and 221121010100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221121010511) 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, 308056 + ... + 732898.
It is an arithmetic number, because the mean of its divisors is an integer number (27759306960).
Almost surely, 2221121010111 is an apocalyptic number.
221121010111 is a deficient number, since it is larger than the sum of its proper divisors (953445569).
221121010111 is a wasteful number, since it uses less digits than its factorization.
221121010111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 427085.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 221121010111 its reverse (111010121122), we get a palindrome (332131131233).
The spelling of 221121010111 in words is "two hundred twenty-one billion, one hundred twenty-one million, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •