Base | Representation |
---|---|
bin | 11001100001000100011110… |
… | …011011011111101101010011 |
3 | 112201100111000101002222202121 |
4 | 121201010132123133231103 |
5 | 104202133130004021202 |
6 | 1034402505555555111 |
7 | 32431616114252644 |
oct | 3141043633375523 |
9 | 481314011088677 |
10 | 112223711001427 |
11 | 32837899215523 |
12 | 107058598bba97 |
13 | 4a8085c30584c |
14 | 1d9d92999d6cb |
15 | ce92e25bb537 |
hex | 66111e6dfb53 |
112223711001427 has 2 divisors, whose sum is σ = 112223711001428. Its totient is φ = 112223711001426.
The previous prime is 112223711001421. The next prime is 112223711001463. The reversal of 112223711001427 is 724100117322211.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 112223711001427 - 231 = 112221563517779 is a prime.
It is a super-2 number, since 2×1122237110014272 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112223711001392 and 112223711001401.
It is not a weakly prime, because it can be changed into another prime (112223711001421) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56111855500713 + 56111855500714.
It is an arithmetic number, because the mean of its divisors is an integer number (56111855500714).
Almost surely, 2112223711001427 is an apocalyptic number.
112223711001427 is a deficient number, since it is larger than the sum of its proper divisors (1).
112223711001427 is an equidigital number, since it uses as much as digits as its factorization.
112223711001427 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 9408, while the sum is 34.
Adding to 112223711001427 its reverse (724100117322211), we get a palindrome (836323828323638).
The spelling of 112223711001427 in words is "one hundred twelve trillion, two hundred twenty-three billion, seven hundred eleven million, one thousand, four hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •