Base | Representation |
---|---|
bin | 110101000000001101100011… |
… | …000000101011000100101011 |
3 | 1010120101012021011120211201002 |
4 | 311000031203000223010223 |
5 | 221023242322321024321 |
6 | 2143441415313345215 |
7 | 100046500111110512 |
oct | 6500154300530453 |
9 | 1116335234524632 |
10 | 233111011111211 |
11 | 68304908642a92 |
12 | 2218a585b6820b |
13 | a00c37405567c |
14 | 417c8c148b679 |
15 | 1be3b4432d20b |
hex | d4036302b12b |
233111011111211 has 2 divisors, whose sum is σ = 233111011111212. Its totient is φ = 233111011111210.
The previous prime is 233111011111079. The next prime is 233111011111261. The reversal of 233111011111211 is 112111110111332.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 233111011111211 - 238 = 232836133204267 is a prime.
It is a super-2 number, since 2×2331110111112112 (a number of 30 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is not a weakly prime, because it can be changed into another prime (233111011111261) 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, 116555505555605 + 116555505555606.
It is an arithmetic number, because the mean of its divisors is an integer number (116555505555606).
Almost surely, 2233111011111211 is an apocalyptic number.
233111011111211 is a deficient number, since it is larger than the sum of its proper divisors (1).
233111011111211 is an equidigital number, since it uses as much as digits as its factorization.
233111011111211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36, while the sum is 20.
Adding to 233111011111211 its reverse (112111110111332), we get a palindrome (345222121222543).
The spelling of 233111011111211 in words is "two hundred thirty-three trillion, one hundred eleven billion, eleven million, one hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •