Base | Representation |
---|---|
bin | 110000000011010010010111… |
… | …100001101110000000111011 |
3 | 1000201021011010022112202220212 |
4 | 300003102113201232000323 |
5 | 210144431131413444402 |
6 | 2025244344335541335 |
7 | 62341145524632326 |
oct | 6003222741560073 |
9 | 1021234108482825 |
10 | 211332113031227 |
11 | 6137849a431191 |
12 | 1b8516b508a84b |
13 | 90bc6c05a7c56 |
14 | 3a287592257bd |
15 | 19673772be952 |
hex | c0349786e03b |
211332113031227 has 2 divisors, whose sum is σ = 211332113031228. Its totient is φ = 211332113031226.
The previous prime is 211332113031203. The next prime is 211332113031287. The reversal of 211332113031227 is 722130311233112.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-211332113031227 is a prime.
It is a super-2 number, since 2×2113321130312272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 211332113031193 and 211332113031202.
It is not a weakly prime, because it can be changed into another prime (211332113031287) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105666056515613 + 105666056515614.
It is an arithmetic number, because the mean of its divisors is an integer number (105666056515614).
Almost surely, 2211332113031227 is an apocalyptic number.
211332113031227 is a deficient number, since it is larger than the sum of its proper divisors (1).
211332113031227 is an equidigital number, since it uses as much as digits as its factorization.
211332113031227 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9072, while the sum is 32.
Adding to 211332113031227 its reverse (722130311233112), we get a palindrome (933462424264339).
The spelling of 211332113031227 in words is "two hundred eleven trillion, three hundred thirty-two billion, one hundred thirteen million, thirty-one thousand, two hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •