Base | Representation |
---|---|
bin | 1100010110001001011… |
… | …0110000011011110111 |
3 | 202021110212012201121212 |
4 | 3011202112300123313 |
5 | 11433342000431411 |
6 | 241234454432035 |
7 | 21216060155105 |
oct | 3054226603367 |
9 | 667425181555 |
10 | 212103530231 |
11 | 81a52a0564a |
12 | 3513506261b |
13 | 17002a62298 |
14 | a3a176cc75 |
15 | 57b5d4568b |
hex | 31625b06f7 |
212103530231 has 2 divisors, whose sum is σ = 212103530232. Its totient is φ = 212103530230.
The previous prime is 212103530213. The next prime is 212103530257. The reversal of 212103530231 is 132035301212.
Together with previous prime (212103530213) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 212103530231 - 218 = 212103268087 is a prime.
It is a super-2 number, since 2×2121035302312 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 212103530197 and 212103530206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (212103539231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 106051765115 + 106051765116.
It is an arithmetic number, because the mean of its divisors is an integer number (106051765116).
Almost surely, 2212103530231 is an apocalyptic number.
212103530231 is a deficient number, since it is larger than the sum of its proper divisors (1).
212103530231 is an equidigital number, since it uses as much as digits as its factorization.
212103530231 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1080, while the sum is 23.
Adding to 212103530231 its reverse (132035301212), we get a palindrome (344138831443).
The spelling of 212103530231 in words is "two hundred twelve billion, one hundred three million, five hundred thirty thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •