Base | Representation |
---|---|
bin | 110010010001011011100110… |
… | …111101000001011110110101 |
3 | 1001222211222021011210100221021 |
4 | 302101123212331001132311 |
5 | 212440001203003020041 |
6 | 2102124010310021141 |
7 | 64366651046402314 |
oct | 6221334675013665 |
9 | 1058758234710837 |
10 | 221100201220021 |
11 | 644a4083577a12 |
12 | 2096a84a0477b1 |
13 | 964a875c41586 |
14 | 3c85441d6827b |
15 | 1a864cc3c1cd1 |
hex | c916e6f417b5 |
221100201220021 has 16 divisors (see below), whose sum is σ = 234162520704000. Its totient is φ = 208044156619008.
The previous prime is 221100201220001. The next prime is 221100201220039. The reversal of 221100201220021 is 120022102001122.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-221100201220021 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221100201219977 and 221100201220004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221100201220001) 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, 1489829380 + ... + 1489977778.
It is an arithmetic number, because the mean of its divisors is an integer number (14635157544000).
Almost surely, 2221100201220021 is an apocalyptic number.
It is an amenable number.
221100201220021 is a deficient number, since it is larger than the sum of its proper divisors (13062319483979).
221100201220021 is a wasteful number, since it uses less digits than its factorization.
221100201220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 168948.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 221100201220021 its reverse (120022102001122), we get a palindrome (341122303221143).
The spelling of 221100201220021 in words is "two hundred twenty-one trillion, one hundred billion, two hundred one million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •