Base | Representation |
---|---|
bin | 1001101001100111001101… |
… | …10101000011100011010101 |
3 | 2210010201010202021121012012 |
4 | 10310303212311003203111 |
5 | 10240141112321010401 |
6 | 113044444203434005 |
7 | 4320111303144455 |
oct | 464634665034325 |
9 | 83121122247165 |
10 | 21221011110101 |
11 | 68418645a5130 |
12 | 2468935825905 |
13 | bac1958a346a |
14 | 53516106bd65 |
15 | 26c0194658bb |
hex | 134ce6d438d5 |
21221011110101 has 32 divisors (see below), whose sum is σ = 23673211600896. Its totient is φ = 18857050480000.
The previous prime is 21221011110053. The next prime is 21221011110119. The reversal of 21221011110101 is 10101111012212.
It is a de Polignac number, because none of the positive numbers 2k-21221011110101 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (21221011110181) 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 31 ways as a sum of consecutive naturals, for example, 3092086196 + ... + 3092093058.
It is an arithmetic number, because the mean of its divisors is an integer number (739787862528).
Almost surely, 221221011110101 is an apocalyptic number.
It is an amenable number.
21221011110101 is a deficient number, since it is larger than the sum of its proper divisors (2452200490795).
21221011110101 is a wasteful number, since it uses less digits than its factorization.
21221011110101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13753.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 21221011110101 its reverse (10101111012212), we get a palindrome (31322122122313).
It can be divided in two parts, 212210 and 11110101, that added together give a palindrome (11322311).
The spelling of 21221011110101 in words is "twenty-one trillion, two hundred twenty-one billion, eleven million, one hundred ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •