Base | Representation |
---|---|
bin | 1010000111011010001110… |
… | …0011100010110110000001 |
3 | 1110101021220011211010111012 |
4 | 2201312203203202312001 |
5 | 2424212201032131223 |
6 | 35353322215330305 |
7 | 2225365536640343 |
oct | 241664343426601 |
9 | 43337804733435 |
10 | 11122414333313 |
11 | 35a8a97a26418 |
12 | 12b7722080995 |
13 | 628aba8750ca |
14 | 2a64833cd293 |
15 | 1444bd5b7c78 |
hex | a1da38e2d81 |
11122414333313 has 2 divisors, whose sum is σ = 11122414333314. Its totient is φ = 11122414333312.
The previous prime is 11122414333253. The next prime is 11122414333319. The reversal of 11122414333313 is 31333341422111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11070313075264 + 52101258049 = 3327208^2 + 228257^2 .
It is a cyclic number.
It is not a de Polignac number, because 11122414333313 - 28 = 11122414333057 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11122414333313.
It is not a weakly prime, because it can be changed into another prime (11122414333319) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561207166656 + 5561207166657.
It is an arithmetic number, because the mean of its divisors is an integer number (5561207166657).
Almost surely, 211122414333313 is an apocalyptic number.
It is an amenable number.
11122414333313 is a deficient number, since it is larger than the sum of its proper divisors (1).
11122414333313 is an equidigital number, since it uses as much as digits as its factorization.
11122414333313 is an evil number, because the sum of its binary digits is even.
The product of its digits is 15552, while the sum is 32.
Adding to 11122414333313 its reverse (31333341422111), we get a palindrome (42455755755424).
The spelling of 11122414333313 in words is "eleven trillion, one hundred twenty-two billion, four hundred fourteen million, three hundred thirty-three thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •