Base | Representation |
---|---|
bin | 1100010010011010101… |
… | …0010000111101010101 |
3 | 202011220001200021211012 |
4 | 3010212222100331111 |
5 | 11424314103324341 |
6 | 240551240422005 |
7 | 21152206326443 |
oct | 3044652207525 |
9 | 664801607735 |
10 | 211102011221 |
11 | 81589644592 |
12 | 34ab5777905 |
13 | 16ba341289a |
14 | a308747b93 |
15 | 5757e640eb |
hex | 3126a90f55 |
211102011221 has 4 divisors (see below), whose sum is σ = 211521697632. Its totient is φ = 210682324812.
The previous prime is 211102011193. The next prime is 211102011233. The reversal of 211102011221 is 122110201112.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211102011221 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 211102011196 and 211102011205.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211102019221) 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, 209842451 + ... + 209843456.
It is an arithmetic number, because the mean of its divisors is an integer number (52880424408).
Almost surely, 2211102011221 is an apocalyptic number.
It is an amenable number.
211102011221 is a deficient number, since it is larger than the sum of its proper divisors (419686411).
211102011221 is an equidigital number, since it uses as much as digits as its factorization.
211102011221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 419686410.
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 211102011221 its reverse (122110201112), we get a palindrome (333212212333).
The spelling of 211102011221 in words is "two hundred eleven billion, one hundred two million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •