Base | Representation |
---|---|
bin | 110010010100101001001111… |
… | …101001100000100011110011 |
3 | 1002000122002012002121121012120 |
4 | 302110221033221200203303 |
5 | 213002110402231403321 |
6 | 2102413244140325323 |
7 | 64421625504055215 |
oct | 6224511751404363 |
9 | 1060562162547176 |
10 | 221321001044211 |
11 | 64579789298962 |
12 | 209a55ab543843 |
13 | 9665633559213 |
14 | 3c91dca6525b5 |
15 | 1a8c101901ec6 |
hex | c94a4fa608f3 |
221321001044211 has 16 divisors (see below), whose sum is σ = 315890813270400. Its totient is φ = 137412503768448.
The previous prime is 221321001044201. The next prime is 221321001044251. The reversal of 221321001044211 is 112440100123122.
It is not a de Polignac number, because 221321001044211 - 26 = 221321001044147 is a prime.
It is a super-2 number, since 2×2213210010442112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (221321001044201) 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 15 ways as a sum of consecutive naturals, for example, 32905289686 + ... + 32905296411.
It is an arithmetic number, because the mean of its divisors is an integer number (19743175829400).
Almost surely, 2221321001044211 is an apocalyptic number.
221321001044211 is a deficient number, since it is larger than the sum of its proper divisors (94569812226189).
221321001044211 is a wasteful number, since it uses less digits than its factorization.
221321001044211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65810586178.
The product of its (nonzero) digits is 768, while the sum is 24.
Adding to 221321001044211 its reverse (112440100123122), we get a palindrome (333761101167333).
The spelling of 221321001044211 in words is "two hundred twenty-one trillion, three hundred twenty-one billion, one million, forty-four thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •