Base | Representation |
---|---|
bin | 110010010011000011111011… |
… | …001101011100110010111101 |
3 | 1002000020200101021111010111011 |
4 | 302103003323031130302331 |
5 | 212443320101304021341 |
6 | 2102251253023355221 |
7 | 64411024534241233 |
oct | 6223037315346275 |
9 | 1060220337433434 |
10 | 221212210220221 |
11 | 64537631751670 |
12 | 209884a9752b11 |
13 | 96582b671729c |
14 | 3c8aa29caa953 |
15 | 1a89385a58b81 |
hex | c930fb35ccbd |
221212210220221 has 64 divisors (see below), whose sum is σ = 249539384586240. Its totient is φ = 194370887208960.
The previous prime is 221212210220219. The next prime is 221212210220341. The reversal of 221212210220221 is 122022012212122.
It is not a de Polignac number, because 221212210220221 - 21 = 221212210220219 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 221212210220192 and 221212210220201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (221212210221221) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 84015270321 + ... + 84015272953.
It is an arithmetic number, because the mean of its divisors is an integer number (3899052884160).
Almost surely, 2221212210220221 is an apocalyptic number.
It is an amenable number.
221212210220221 is a deficient number, since it is larger than the sum of its proper divisors (28327174366019).
221212210220221 is a wasteful number, since it uses less digits than its factorization.
221212210220221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5794.
The product of its (nonzero) digits is 512, while the sum is 22.
Adding to 221212210220221 its reverse (122022012212122), we get a palindrome (343234222432343).
The spelling of 221212210220221 in words is "two hundred twenty-one trillion, two hundred twelve billion, two hundred ten million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •