Base | Representation |
---|---|
bin | 1100010011101011111… |
… | …1100010001101000001 |
3 | 202012202211112222110112 |
4 | 3010322333202031001 |
5 | 11431013420144301 |
6 | 241045144041105 |
7 | 21163520650361 |
oct | 3047277421501 |
9 | 665684488415 |
10 | 211443131201 |
11 | 81744154025 |
12 | 34b8ba63195 |
13 | 16c28ca9c23 |
14 | a33bb829a1 |
15 | 5777d969bb |
hex | 313afe2341 |
211443131201 has 2 divisors, whose sum is σ = 211443131202. Its totient is φ = 211443131200.
The previous prime is 211443131161. The next prime is 211443131219. The reversal of 211443131201 is 102131344112.
211443131201 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 188702491201 + 22740640000 = 434399^2 + 150800^2 .
It is a cyclic number.
It is not a de Polignac number, because 211443131201 - 210 = 211443130177 is a prime.
It is not a weakly prime, because it can be changed into another prime (211443131281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105721565600 + 105721565601.
It is an arithmetic number, because the mean of its divisors is an integer number (105721565601).
Almost surely, 2211443131201 is an apocalyptic number.
It is an amenable number.
211443131201 is a deficient number, since it is larger than the sum of its proper divisors (1).
211443131201 is an equidigital number, since it uses as much as digits as its factorization.
211443131201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 576, while the sum is 23.
Adding to 211443131201 its reverse (102131344112), we get a palindrome (313574475313).
The spelling of 211443131201 in words is "two hundred eleven billion, four hundred forty-three million, one hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •