Base | Representation |
---|---|
bin | 1100010011100100100… |
… | …0110100100101001101 |
3 | 202012200122222221001010 |
4 | 3010321020310211031 |
5 | 11430432433330331 |
6 | 241042113035433 |
7 | 21162662306046 |
oct | 3047110644515 |
9 | 665618887033 |
10 | 211412011341 |
11 | 81728629233 |
12 | 34b81555b79 |
13 | 16c227022cb |
14 | a3379a18cd |
15 | 577529ae46 |
hex | 313923494d |
211412011341 has 8 divisors (see below), whose sum is σ = 281897183680. Its totient is φ = 140934089952.
The previous prime is 211412011319. The next prime is 211412011351. The reversal of 211412011341 is 143110214112.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 211412011341 - 25 = 211412011309 is a prime.
It is a super-2 number, since 2×2114120113412 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (211412011351) by changing a digit.
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, 1744336 + ... + 1861593.
It is an arithmetic number, because the mean of its divisors is an integer number (35237147960).
Almost surely, 2211412011341 is an apocalyptic number.
It is an amenable number.
211412011341 is a deficient number, since it is larger than the sum of its proper divisors (70485172339).
211412011341 is a wasteful number, since it uses less digits than its factorization.
211412011341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3625475.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 211412011341 its reverse (143110214112), we get a palindrome (354522225453).
The spelling of 211412011341 in words is "two hundred eleven billion, four hundred twelve million, eleven thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •