Base | Representation |
---|---|
bin | 1010001110011000100100… |
… | …1001100101010000000101 |
3 | 1110210202011100220011112121 |
4 | 2203212021021211100011 |
5 | 2433143041440412401 |
6 | 35524335341445541 |
7 | 2240136643511104 |
oct | 243461111452005 |
9 | 43722140804477 |
10 | 11242230404101 |
11 | 3644891a84824 |
12 | 13169a02708b1 |
13 | 6371a3911008 |
14 | 2ac1ac13803b |
15 | 14768233aca1 |
hex | a3989265405 |
11242230404101 has 2 divisors, whose sum is σ = 11242230404102. Its totient is φ = 11242230404100.
The previous prime is 11242230404077. The next prime is 11242230404113. The reversal of 11242230404101 is 10140403224211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6934110892900 + 4308119511201 = 2633270^2 + 2075601^2 .
It is a cyclic number.
It is not a de Polignac number, because 11242230404101 - 27 = 11242230403973 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11242230404701) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5621115202050 + 5621115202051.
It is an arithmetic number, because the mean of its divisors is an integer number (5621115202051).
Almost surely, 211242230404101 is an apocalyptic number.
It is an amenable number.
11242230404101 is a deficient number, since it is larger than the sum of its proper divisors (1).
11242230404101 is an equidigital number, since it uses as much as digits as its factorization.
11242230404101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 11242230404101 its reverse (10140403224211), we get a palindrome (21382633628312).
The spelling of 11242230404101 in words is "eleven trillion, two hundred forty-two billion, two hundred thirty million, four hundred four thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •