Base | Representation |
---|---|
bin | 1100010111000000001… |
… | …0111110010010011001 |
3 | 202022001212102102202201 |
4 | 3011300002332102121 |
5 | 11434324301200423 |
6 | 241313341530201 |
7 | 21224546430352 |
oct | 3056002762231 |
9 | 668055372681 |
10 | 212333225113 |
11 | 8206062a829 |
12 | 35199b73961 |
13 | 1703b515709 |
14 | a3c4080d29 |
15 | 57cb0b82ad |
hex | 31700be499 |
212333225113 has 2 divisors, whose sum is σ = 212333225114. Its totient is φ = 212333225112.
The previous prime is 212333225107. The next prime is 212333225131. The reversal of 212333225113 is 311522333212.
Together with next prime (212333225131) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 158820581529 + 53512643584 = 398523^2 + 231328^2 .
It is a cyclic number.
It is not a de Polignac number, because 212333225113 - 221 = 212331127961 is a prime.
It is not a weakly prime, because it can be changed into another prime (212333225173) 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, 106166612556 + 106166612557.
It is an arithmetic number, because the mean of its divisors is an integer number (106166612557).
Almost surely, 2212333225113 is an apocalyptic number.
It is an amenable number.
212333225113 is a deficient number, since it is larger than the sum of its proper divisors (1).
212333225113 is an equidigital number, since it uses as much as digits as its factorization.
212333225113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6480, while the sum is 28.
Adding to 212333225113 its reverse (311522333212), we get a palindrome (523855558325).
The spelling of 212333225113 in words is "two hundred twelve billion, three hundred thirty-three million, two hundred twenty-five thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •