Base | Representation |
---|---|
bin | 1010000110110001010110… |
… | …1011111001000010100001 |
3 | 1110100020120122121201222101 |
4 | 2201230111223321002201 |
5 | 2424022214210101423 |
6 | 35344305500010401 |
7 | 2224526642351014 |
oct | 241542553710241 |
9 | 43306518551871 |
10 | 11111444222113 |
11 | 35a4378652514 |
12 | 12b5580230a01 |
13 | 627a5cbb3c51 |
14 | 2a5b2249d37b |
15 | 14407a47e7ad |
hex | a1b15af90a1 |
11111444222113 has 2 divisors, whose sum is σ = 11111444222114. Its totient is φ = 11111444222112.
The previous prime is 11111444222101. The next prime is 11111444222147. The reversal of 11111444222113 is 31122244411111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10385460131904 + 725984090209 = 3222648^2 + 852047^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11111444222113 is a prime.
It is a super-2 number, since 2×111114442221132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11111444232113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5555722111056 + 5555722111057.
It is an arithmetic number, because the mean of its divisors is an integer number (5555722111057).
Almost surely, 211111444222113 is an apocalyptic number.
It is an amenable number.
11111444222113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11111444222113 is an equidigital number, since it uses as much as digits as its factorization.
11111444222113 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1536, while the sum is 28.
Adding to 11111444222113 its reverse (31122244411111), we get a palindrome (42233688633224).
The spelling of 11111444222113 in words is "eleven trillion, one hundred eleven billion, four hundred forty-four million, two hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •