Base | Representation |
---|---|
bin | 1100110111101111010… |
… | …1101011011010011000 |
3 | 210010202022011201011212 |
4 | 3031323311223122120 |
5 | 12110323434013422 |
6 | 245325342242252 |
7 | 21655404332504 |
oct | 3157365533230 |
9 | 703668151155 |
10 | 221121001112 |
11 | 85860049a20 |
12 | 36a30b86388 |
13 | 17b0c01b77b |
14 | a9b9211304 |
15 | 5b428239e2 |
hex | 337bd6b698 |
221121001112 has 16 divisors (see below), whose sum is σ = 452292957000. Its totient is φ = 100509545920.
The previous prime is 221121001111. The next prime is 221121001163. The reversal of 221121001112 is 211100121122.
221121001112 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221121001111) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1256369237 + ... + 1256369412.
Almost surely, 2221121001112 is an apocalyptic number.
221121001112 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
221121001112 is an abundant number, since it is smaller than the sum of its proper divisors (231171955888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
221121001112 is a wasteful number, since it uses less digits than its factorization.
221121001112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2512738666 (or 2512738662 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 221121001112 its reverse (211100121122), we get a palindrome (432221122234).
The spelling of 221121001112 in words is "two hundred twenty-one billion, one hundred twenty-one million, one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •