Base | Representation |
---|---|
bin | 1100010110101010001… |
… | …1010100101110000111 |
3 | 202021211102222001201212 |
4 | 3011222203110232013 |
5 | 11434132201323221 |
6 | 241300250042035 |
7 | 21222350044004 |
oct | 3055243245607 |
9 | 667742861655 |
10 | 212241042311 |
11 | 820135984a1 |
12 | 3517311931b |
13 | 170253ab08c |
14 | a3b5b268ab |
15 | 57c2e59b5b |
hex | 316a8d4b87 |
212241042311 has 2 divisors, whose sum is σ = 212241042312. Its totient is φ = 212241042310.
The previous prime is 212241042283. The next prime is 212241042341. The reversal of 212241042311 is 113240142212.
212241042311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-212241042311 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212241042341) 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, 106120521155 + 106120521156.
It is an arithmetic number, because the mean of its divisors is an integer number (106120521156).
Almost surely, 2212241042311 is an apocalyptic number.
212241042311 is a deficient number, since it is larger than the sum of its proper divisors (1).
212241042311 is an equidigital number, since it uses as much as digits as its factorization.
212241042311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
Adding to 212241042311 its reverse (113240142212), we get a palindrome (325481184523).
Subtracting from 212241042311 its reverse (113240142212), we obtain a palindrome (99000900099).
The spelling of 212241042311 in words is "two hundred twelve billion, two hundred forty-one million, forty-two thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.139 sec. • engine limits •