Base | Representation |
---|---|
bin | 101111110001100010001001… |
… | …110011111111111101000011 |
3 | 1000112221112002100210200220102 |
4 | 233301202021303333331003 |
5 | 210014434101212331321 |
6 | 2022512101040433015 |
7 | 62154046004135132 |
oct | 5761421163777503 |
9 | 1015845070720812 |
10 | 210112112230211 |
11 | 60a48056819284 |
12 | 1b69517531876b |
13 | 90316443c4b59 |
14 | 39c56a2687919 |
15 | 194577175ac0b |
hex | bf1889cfff43 |
210112112230211 has 2 divisors, whose sum is σ = 210112112230212. Its totient is φ = 210112112230210.
The previous prime is 210112112230183. The next prime is 210112112230271. The reversal of 210112112230211 is 112032211211012.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-210112112230211 is a prime.
It is a super-2 number, since 2×2101121122302112 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (210112112230271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105056056115105 + 105056056115106.
It is an arithmetic number, because the mean of its divisors is an integer number (105056056115106).
Almost surely, 2210112112230211 is an apocalyptic number.
210112112230211 is a deficient number, since it is larger than the sum of its proper divisors (1).
210112112230211 is an equidigital number, since it uses as much as digits as its factorization.
210112112230211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 210112112230211 its reverse (112032211211012), we get a palindrome (322144323441223).
The spelling of 210112112230211 in words is "two hundred ten trillion, one hundred twelve billion, one hundred twelve million, two hundred thirty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •