Base | Representation |
---|---|
bin | 1010001110010100110110… |
… | …0110110110110011111001 |
3 | 1110210122120202011210121022 |
4 | 2203211031212312303321 |
5 | 2433134020222221431 |
6 | 35524052254352225 |
7 | 2240103123504440 |
oct | 243451546666371 |
9 | 43718522153538 |
10 | 11241231445241 |
11 | 364441a102196 |
12 | 13167617bb675 |
13 | 6370749799b5 |
14 | 2ac1155bbd57 |
15 | 1476247b307b |
hex | a394d9b6cf9 |
11241231445241 has 4 divisors (see below), whose sum is σ = 12847121651712. Its totient is φ = 9635341238772.
The previous prime is 11241231445201. The next prime is 11241231445247. The reversal of 11241231445241 is 14254413214211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11241231445241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11241231445247) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 802945103225 + ... + 802945103238.
It is an arithmetic number, because the mean of its divisors is an integer number (3211780412928).
Almost surely, 211241231445241 is an apocalyptic number.
It is an amenable number.
11241231445241 is a deficient number, since it is larger than the sum of its proper divisors (1605890206471).
11241231445241 is an equidigital number, since it uses as much as digits as its factorization.
11241231445241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1605890206470.
The product of its digits is 30720, while the sum is 35.
Adding to 11241231445241 its reverse (14254413214211), we get a palindrome (25495644659452).
The spelling of 11241231445241 in words is "eleven trillion, two hundred forty-one billion, two hundred thirty-one million, four hundred forty-five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •