Base | Representation |
---|---|
bin | 110000000000100011011000… |
… | …011111001111100101010111 |
3 | 1000200121012011000211100010120 |
4 | 300000203120133033211113 |
5 | 210133341332412342221 |
6 | 2025022152333123023 |
7 | 62321444466255333 |
oct | 6000433037174527 |
9 | 1020535130740116 |
10 | 211144224340311 |
11 | 61305843137839 |
12 | 1b8211b9629473 |
13 | 90a7a794c3772 |
14 | 3a1d6138587c3 |
15 | 196252c2565c6 |
hex | c008d87cf957 |
211144224340311 has 16 divisors (see below), whose sum is σ = 287516012659200. Its totient is φ = 137767635981248.
The previous prime is 211144224340243. The next prime is 211144224340321. The reversal of 211144224340311 is 113043422441112.
It is a cyclic number.
It is not a de Polignac number, because 211144224340311 - 210 = 211144224339287 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211144224340321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 152789080 + ... + 154164818.
It is an arithmetic number, because the mean of its divisors is an integer number (17969750791200).
Almost surely, 2211144224340311 is an apocalyptic number.
211144224340311 is a deficient number, since it is larger than the sum of its proper divisors (76371788318889).
211144224340311 is a wasteful number, since it uses less digits than its factorization.
211144224340311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2464278.
The product of its (nonzero) digits is 18432, while the sum is 33.
Adding to 211144224340311 its reverse (113043422441112), we get a palindrome (324187646781423).
The spelling of 211144224340311 in words is "two hundred eleven trillion, one hundred forty-four billion, two hundred twenty-four million, three hundred forty thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •