Base | Representation |
---|---|
bin | 1100010010011101010… |
… | …0101110000010010011 |
3 | 202011220211121201010221 |
4 | 3010213110232002103 |
5 | 11424324430442441 |
6 | 240552315133511 |
7 | 21152403041110 |
oct | 3044724560223 |
9 | 664824551127 |
10 | 211113140371 |
11 | 81594956031 |
12 | 34ab9444297 |
13 | 16ba580b393 |
14 | a30a003907 |
15 | 5758e118d1 |
hex | 312752e093 |
211113140371 has 8 divisors (see below), whose sum is σ = 244577259104. Its totient is φ = 178475296320.
The previous prime is 211113140351. The next prime is 211113140417. The reversal of 211113140371 is 173041311112.
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 211113140371 - 29 = 211113139859 is a prime.
It is the 459471-st Hogben number.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211113140341) by changing a digit.
It is a nontrivial repunit in base 459470.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 206568120 + ... + 206569141.
It is an arithmetic number, because the mean of its divisors is an integer number (30572157388).
Almost surely, 2211113140371 is an apocalyptic number.
211113140371 is a deficient number, since it is larger than the sum of its proper divisors (33464118733).
211113140371 is an equidigital number, since it uses as much as digits as its factorization.
211113140371 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 413137341.
The product of its (nonzero) digits is 504, while the sum is 25.
Adding to 211113140371 its reverse (173041311112), we get a palindrome (384154451483).
The spelling of 211113140371 in words is "two hundred eleven billion, one hundred thirteen million, one hundred forty thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •