Base | Representation |
---|---|
bin | 11110101110001000000… |
… | …010100101111010000111 |
3 | 21110211010222101220021022 |
4 | 132232020002211322013 |
5 | 234042023444321041 |
6 | 4253455310141355 |
7 | 305344210112036 |
oct | 36561002457207 |
9 | 7424128356238 |
10 | 2111111323271 |
11 | 74435433a585 |
12 | 2a1192ab185b |
13 | 124100077bc2 |
14 | 7426d4bc71d |
15 | 39dac94624b |
hex | 1eb880a5e87 |
2111111323271 has 2 divisors, whose sum is σ = 2111111323272. Its totient is φ = 2111111323270.
The previous prime is 2111111323199. The next prime is 2111111323309. The reversal of 2111111323271 is 1723231111112.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2111111323271 is a prime.
It is a super-3 number, since 3×21111113232713 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a self number, because there is not a number n which added to its sum of digits gives 2111111323271.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2111111323171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1055555661635 + 1055555661636.
It is an arithmetic number, because the mean of its divisors is an integer number (1055555661636).
Almost surely, 22111111323271 is an apocalyptic number.
2111111323271 is a deficient number, since it is larger than the sum of its proper divisors (1).
2111111323271 is an equidigital number, since it uses as much as digits as its factorization.
2111111323271 is an evil number, because the sum of its binary digits is even.
The product of its digits is 504, while the sum is 26.
Adding to 2111111323271 its reverse (1723231111112), we get a palindrome (3834342434383).
The spelling of 2111111323271 in words is "two trillion, one hundred eleven billion, one hundred eleven million, three hundred twenty-three thousand, two hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •