Base | Representation |
---|---|
bin | 1100010011001101001… |
… | …0111111011110111101 |
3 | 202012102211121011011012 |
4 | 3010303102333132331 |
5 | 11430232341423031 |
6 | 241024252405005 |
7 | 21160362324656 |
oct | 3046322773675 |
9 | 665384534135 |
10 | 211314014141 |
11 | 8168828550a |
12 | 34b54776765 |
13 | 16c083102b9 |
14 | a32897252d |
15 | 576b88eb2b |
hex | 31334bf7bd |
211314014141 has 2 divisors, whose sum is σ = 211314014142. Its totient is φ = 211314014140.
The previous prime is 211314014117. The next prime is 211314014143. The reversal of 211314014141 is 141410413112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 118075391641 + 93238622500 = 343621^2 + 305350^2 .
It is a cyclic number.
It is not a de Polignac number, because 211314014141 - 26 = 211314014077 is a prime.
It is a super-2 number, since 2×2113140141412 (a number of 23 digits) contains 22 as substring.
Together with 211314014143, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211314014143) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105657007070 + 105657007071.
It is an arithmetic number, because the mean of its divisors is an integer number (105657007071).
Almost surely, 2211314014141 is an apocalyptic number.
It is an amenable number.
211314014141 is a deficient number, since it is larger than the sum of its proper divisors (1).
211314014141 is an equidigital number, since it uses as much as digits as its factorization.
211314014141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 23.
Adding to 211314014141 its reverse (141410413112), we get a palindrome (352724427253).
The spelling of 211314014141 in words is "two hundred eleven billion, three hundred fourteen million, fourteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •