Base | Representation |
---|---|
bin | 110000001110011111011000… |
… | …011100000110001001001101 |
3 | 1000210222202100011000010102002 |
4 | 300032133120130012021031 |
5 | 210300034344303102341 |
6 | 2031034151511442045 |
7 | 62450602213400615 |
oct | 6016373034061115 |
9 | 1023882304003362 |
10 | 212102001222221 |
11 | 61644a54225110 |
12 | 1b956957086325 |
13 | 9147195c72956 |
14 | 3a53b12359a45 |
15 | 197c3d6c4e29b |
hex | c0e7d870624d |
212102001222221 has 32 divisors (see below), whose sum is σ = 237750095904768. Its totient is φ = 187566827811840.
The previous prime is 212102001222217. The next prime is 212102001222227. The reversal of 212102001222221 is 122222100201212.
It is a cyclic number.
It is not a de Polignac number, because 212102001222221 - 22 = 212102001222217 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 212102001222193 and 212102001222202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212102001222227) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 107484176 + ... + 109439718.
It is an arithmetic number, because the mean of its divisors is an integer number (7429690497024).
Almost surely, 2212102001222221 is an apocalyptic number.
It is an amenable number.
212102001222221 is a deficient number, since it is larger than the sum of its proper divisors (25648094682547).
212102001222221 is a wasteful number, since it uses less digits than its factorization.
212102001222221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1956881.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 212102001222221 its reverse (122222100201212), we get a palindrome (334324101423433).
The spelling of 212102001222221 in words is "two hundred twelve trillion, one hundred two billion, one million, two hundred twenty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •