Base | Representation |
---|---|
bin | 1100001110110011001… |
… | …1000001000100111001 |
3 | 202002101101222100010201 |
4 | 3003230303001010321 |
5 | 11420322043230222 |
6 | 240311041242201 |
7 | 21116150646532 |
oct | 3035463010471 |
9 | 662341870121 |
10 | 210131226937 |
11 | 81130665a25 |
12 | 34884633361 |
13 | 16a7a264708 |
14 | a255843689 |
15 | 56ecb04427 |
hex | 30eccc1139 |
210131226937 has 2 divisors, whose sum is σ = 210131226938. Its totient is φ = 210131226936.
The previous prime is 210131226911. The next prime is 210131226941. The reversal of 210131226937 is 739622131012.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 194918718016 + 15212508921 = 441496^2 + 123339^2 .
It is a cyclic number.
It is not a de Polignac number, because 210131226937 - 211 = 210131224889 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 210131226896 and 210131226905.
It is not a weakly prime, because it can be changed into another prime (210131226967) 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 as a sum of consecutive naturals, namely, 105065613468 + 105065613469.
It is an arithmetic number, because the mean of its divisors is an integer number (105065613469).
Almost surely, 2210131226937 is an apocalyptic number.
It is an amenable number.
210131226937 is a deficient number, since it is larger than the sum of its proper divisors (1).
210131226937 is an equidigital number, since it uses as much as digits as its factorization.
210131226937 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27216, while the sum is 37.
Adding to 210131226937 its reverse (739622131012), we get a palindrome (949753357949).
The spelling of 210131226937 in words is "two hundred ten billion, one hundred thirty-one million, two hundred twenty-six thousand, nine hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •