Base | Representation |
---|---|
bin | 1100010010011010011… |
… | …1101000101111110111 |
3 | 202011220000101021201001 |
4 | 3010212213220233313 |
5 | 11424313414302411 |
6 | 240551213544131 |
7 | 21152200426642 |
oct | 3044647505767 |
9 | 664800337631 |
10 | 211101322231 |
11 | 81589213978 |
12 | 34ab54a5047 |
13 | 16ba32310b7 |
14 | a308608a59 |
15 | 5757d79dc1 |
hex | 31269e8bf7 |
211101322231 has 8 divisors (see below), whose sum is σ = 218558404800. Its totient is φ = 203656088160.
The previous prime is 211101322219. The next prime is 211101322283. The reversal of 211101322231 is 132223101112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 211101322231 - 229 = 210564451319 is a prime.
It is a super-2 number, since 2×2111013222312 (a number of 23 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 = 211101322199 and 211101322208.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211101322631) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2925855 + ... + 2997136.
It is an arithmetic number, because the mean of its divisors is an integer number (27319800600).
Almost surely, 2211101322231 is an apocalyptic number.
211101322231 is a deficient number, since it is larger than the sum of its proper divisors (7457082569).
211101322231 is a wasteful number, since it uses less digits than its factorization.
211101322231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5924249.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 211101322231 its reverse (132223101112), we get a palindrome (343324423343).
The spelling of 211101322231 in words is "two hundred eleven billion, one hundred one million, three hundred twenty-two thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •