Base | Representation |
---|---|
bin | 100000000010000010010… |
… | …101110011101001100011 |
3 | 21210102201002222102102111 |
4 | 200002002111303221203 |
5 | 242031034230311321 |
6 | 4403115533500151 |
7 | 315014015241442 |
oct | 40020225635143 |
9 | 7712632872374 |
10 | 2201210010211 |
11 | 779589735623 |
12 | 2b6738941657 |
13 | 12c75b471104 |
14 | 78779548d59 |
15 | 3c3d27b85e1 |
hex | 20082573a63 |
2201210010211 has 4 divisors (see below), whose sum is σ = 2201477382712. Its totient is φ = 2200942637712.
The previous prime is 2201210010199. The next prime is 2201210010281. The reversal of 2201210010211 is 1120100121022.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 2201210010211 - 221 = 2201207913059 is a prime.
It is a super-2 number, since 2×22012100102112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2201210010191 and 2201210010200.
It is not an unprimeable number, because it can be changed into a prime (2201210010281) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 133673901 + ... + 133690366.
It is an arithmetic number, because the mean of its divisors is an integer number (550369345678).
Almost surely, 22201210010211 is an apocalyptic number.
2201210010211 is a deficient number, since it is larger than the sum of its proper divisors (267372501).
2201210010211 is an equidigital number, since it uses as much as digits as its factorization.
2201210010211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 267372500.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 2201210010211 its reverse (1120100121022), we get a palindrome (3321310131233).
The spelling of 2201210010211 in words is "two trillion, two hundred one billion, two hundred ten million, ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •