Base | Representation |
---|---|
bin | 110010010001100101110111… |
… | …101111001001000111110011 |
3 | 1001222220000201002222011120010 |
4 | 302101211313233021013303 |
5 | 212440141234333242321 |
6 | 2102133031533150003 |
7 | 64400521106316060 |
oct | 6221456757110763 |
9 | 1058800632864503 |
10 | 221111220212211 |
11 | 644a88184a792a |
12 | 20970a0432b303 |
13 | 964b910a886b4 |
14 | 3c85ba957dc67 |
15 | 1a86924963676 |
hex | c91977bc91f3 |
221111220212211 has 16 divisors (see below), whose sum is σ = 336931615689984. Its totient is φ = 126349181501664.
The previous prime is 221111220212203. The next prime is 221111220212237. The reversal of 221111220212211 is 112212022111122.
It is not a de Polignac number, because 221111220212211 - 23 = 221111220212203 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is not an unprimeable number, because it can be changed into a prime (221111220212291) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 39349045 + ... + 44615801.
It is an arithmetic number, because the mean of its divisors is an integer number (21058225980624).
Almost surely, 2221111220212211 is an apocalyptic number.
221111220212211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
221111220212211 is a deficient number, since it is larger than the sum of its proper divisors (115820395477773).
221111220212211 is a wasteful number, since it uses less digits than its factorization.
221111220212211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7265930.
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 221111220212211 its reverse (112212022111122), we get a palindrome (333323242323333).
The spelling of 221111220212211 in words is "two hundred twenty-one trillion, one hundred eleven billion, two hundred twenty million, two hundred twelve thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •