Base | Representation |
---|---|
bin | 1010001000100100000000… |
… | …1001000001000101110001 |
3 | 1110110012000120001211121001 |
4 | 2202021000021001011301 |
5 | 2430023232121141114 |
6 | 35410355451002001 |
7 | 2226666426064504 |
oct | 242110011010561 |
9 | 43405016054531 |
10 | 11142221271409 |
11 | 3606431481148 |
12 | 12bb52b439301 |
13 | 62a926254717 |
14 | 2a7401bbb13b |
15 | 144c7c3ea374 |
hex | a2240241171 |
11142221271409 has 2 divisors, whose sum is σ = 11142221271410. Its totient is φ = 11142221271408.
The previous prime is 11142221271263. The next prime is 11142221271413. The reversal of 11142221271409 is 90417212224111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11012794013809 + 129427257600 = 3318553^2 + 359760^2 .
It is a cyclic number.
It is not a de Polignac number, because 11142221271409 - 219 = 11142220747121 is a prime.
It is a super-2 number, since 2×111422212714092 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11142221221409) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5571110635704 + 5571110635705.
It is an arithmetic number, because the mean of its divisors is an integer number (5571110635705).
Almost surely, 211142221271409 is an apocalyptic number.
It is an amenable number.
11142221271409 is a deficient number, since it is larger than the sum of its proper divisors (1).
11142221271409 is an equidigital number, since it uses as much as digits as its factorization.
11142221271409 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16128, while the sum is 37.
The spelling of 11142221271409 in words is "eleven trillion, one hundred forty-two billion, two hundred twenty-one million, two hundred seventy-one thousand, four hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •