Base | Representation |
---|---|
bin | 1011000111010011011101… |
… | …1011110111111101100111 |
3 | 1121021020020121122210220021 |
4 | 2301310313123313331213 |
5 | 3100203242133323421 |
6 | 41553501510220011 |
7 | 2400605524152304 |
oct | 261646733677547 |
9 | 47236217583807 |
10 | 12220112011111 |
11 | 399157a71a694 |
12 | 145440a954607 |
13 | 6a8475674244 |
14 | 303656bc20ab |
15 | 162d16d89341 |
hex | b1d376f7f67 |
12220112011111 has 2 divisors, whose sum is σ = 12220112011112. Its totient is φ = 12220112011110.
The previous prime is 12220112011091. The next prime is 12220112011141. The reversal of 12220112011111 is 11111021102221.
It is a weak prime.
It is an emirp because it is prime and its reverse (11111021102221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 12220112011111 - 213 = 12220112002919 is a prime.
It is a super-3 number, since 3×122201120111113 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12220112011141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6110056005555 + 6110056005556.
It is an arithmetic number, because the mean of its divisors is an integer number (6110056005556).
Almost surely, 212220112011111 is an apocalyptic number.
12220112011111 is a deficient number, since it is larger than the sum of its proper divisors (1).
12220112011111 is an equidigital number, since it uses as much as digits as its factorization.
12220112011111 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 12220112011111 its reverse (11111021102221), we get a palindrome (23331133113332).
The spelling of 12220112011111 in words is "twelve trillion, two hundred twenty billion, one hundred twelve million, eleven thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •