Base | Representation |
---|---|
bin | 11001001100000… |
… | …11101010010101 |
3 | 112201121022022022 |
4 | 30212003222111 |
5 | 413043144221 |
6 | 32544542525 |
7 | 5144021624 |
oct | 1446035225 |
9 | 481538268 |
10 | 211303061 |
11 | a9303132 |
12 | 5a921a45 |
13 | 34a13cc8 |
14 | 200c56bb |
15 | 1383d4ab |
hex | c983a95 |
211303061 has 2 divisors, whose sum is σ = 211303062. Its totient is φ = 211303060.
The previous prime is 211303051. The next prime is 211303063. The reversal of 211303061 is 160303112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 157000900 + 54302161 = 12530^2 + 7369^2 .
It is a cyclic number.
It is not a de Polignac number, because 211303061 - 210 = 211302037 is a prime.
It is a Sophie Germain prime.
Together with 211303063, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (211303063) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105651530 + 105651531.
It is an arithmetic number, because the mean of its divisors is an integer number (105651531).
Almost surely, 2211303061 is an apocalyptic number.
It is an amenable number.
211303061 is a deficient number, since it is larger than the sum of its proper divisors (1).
211303061 is an equidigital number, since it uses as much as digits as its factorization.
211303061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
The square root of 211303061 is about 14536.2670930332. The cubic root of 211303061 is about 595.6190727205.
Adding to 211303061 its reverse (160303112), we get a palindrome (371606173).
The spelling of 211303061 in words is "two hundred eleven million, three hundred three thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •