Base | Representation |
---|---|
bin | 110000000001110100010011… |
… | …111000101100000101100011 |
3 | 1000200220111102221202000011122 |
4 | 300001310103320230011203 |
5 | 210141302313233243243 |
6 | 2025130123105202455 |
7 | 62330642034062141 |
oct | 6001642370540543 |
9 | 1020814387660148 |
10 | 211231120212323 |
11 | 613396846375a2 |
12 | 1b83600a93042b |
13 | 90b30171a3b03 |
14 | 3a238d83a6591 |
15 | 1964915d21668 |
hex | c01d13e2c163 |
211231120212323 has 2 divisors, whose sum is σ = 211231120212324. Its totient is φ = 211231120212322.
The previous prime is 211231120212271. The next prime is 211231120212337. The reversal of 211231120212323 is 323212021132112.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 211231120212323 - 222 = 211231116018019 is a prime.
It is a super-2 number, since 2×2112311202123232 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211231120212292 and 211231120212301.
It is not a weakly prime, because it can be changed into another prime (211231120212353) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105615560106161 + 105615560106162.
It is an arithmetic number, because the mean of its divisors is an integer number (105615560106162).
Almost surely, 2211231120212323 is an apocalyptic number.
211231120212323 is a deficient number, since it is larger than the sum of its proper divisors (1).
211231120212323 is an equidigital number, since it uses as much as digits as its factorization.
211231120212323 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 211231120212323 its reverse (323212021132112), we get a palindrome (534443141344435).
The spelling of 211231120212323 in words is "two hundred eleven trillion, two hundred thirty-one billion, one hundred twenty million, two hundred twelve thousand, three hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •