Base | Representation |
---|---|
bin | 1010011010000001001110… |
… | …1111111100001110011101 |
3 | 1111111212010022100200121221 |
4 | 2212200103233330032131 |
5 | 2444431432244223401 |
6 | 40200234515453341 |
7 | 2260444335030403 |
oct | 246402357741635 |
9 | 44455108320557 |
10 | 11442124211101 |
11 | 3711639904611 |
12 | 13496882b7251 |
13 | 64ccabc2b89c |
14 | 2b7b32095473 |
15 | 14c9812d57a1 |
hex | a6813bfc39d |
11442124211101 has 2 divisors, whose sum is σ = 11442124211102. Its totient is φ = 11442124211100.
The previous prime is 11442124210963. The next prime is 11442124211107. The reversal of 11442124211101 is 10111242124411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10352499300900 + 1089624910201 = 3217530^2 + 1043851^2 .
It is a cyclic number.
It is not a de Polignac number, because 11442124211101 - 215 = 11442124178333 is a prime.
It is a super-2 number, since 2×114421242111012 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11442124211107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5721062105550 + 5721062105551.
It is an arithmetic number, because the mean of its divisors is an integer number (5721062105551).
Almost surely, 211442124211101 is an apocalyptic number.
It is an amenable number.
11442124211101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11442124211101 is an equidigital number, since it uses as much as digits as its factorization.
11442124211101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 512, while the sum is 25.
Adding to 11442124211101 its reverse (10111242124411), we get a palindrome (21553366335512).
The spelling of 11442124211101 in words is "eleven trillion, four hundred forty-two billion, one hundred twenty-four million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •