Base | Representation |
---|---|
bin | 1100010010011101000… |
… | …0011100110011011011 |
3 | 202011220202111211221120 |
4 | 3010213100130303123 |
5 | 11424324134134321 |
6 | 240552235140323 |
7 | 21152360400210 |
oct | 3044720346333 |
9 | 664822454846 |
10 | 211112021211 |
11 | 81594261203 |
12 | 34ab8ba46a3 |
13 | 16ba5508b60 |
14 | a309bd1b07 |
15 | 5758c8eec6 |
hex | 312741ccdb |
211112021211 has 64 divisors (see below), whose sum is σ = 356177353728. Its totient is φ = 108232339968.
The previous prime is 211112021203. The next prime is 211112021233. The reversal of 211112021211 is 112120211112.
It is a happy number.
211112021211 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 211112021211 - 23 = 211112021203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (211112021261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10060216 + ... + 10081178.
It is an arithmetic number, because the mean of its divisors is an integer number (5565271152).
Almost surely, 2211112021211 is an apocalyptic number.
211112021211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
211112021211 is a deficient number, since it is larger than the sum of its proper divisors (145065332517).
211112021211 is a wasteful number, since it uses less digits than its factorization.
211112021211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22020.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 211112021211 its reverse (112120211112), we get a palindrome (323232232323).
The spelling of 211112021211 in words is "two hundred eleven billion, one hundred twelve million, twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •