Base | Representation |
---|---|
bin | 1010001101010001000101… |
… | …1000010111001000101101 |
3 | 1110201220122000220201110010 |
4 | 2203110101120113020231 |
5 | 2432334242013041331 |
6 | 35511443253203433 |
7 | 2235560264466336 |
oct | 243242130271055 |
9 | 43656560821403 |
10 | 11223041143341 |
11 | 3637735161135 |
12 | 1313125930579 |
13 | 6354361a9451 |
14 | 2ab2ab7b528d |
15 | 146e0c868e46 |
hex | a351161722d |
11223041143341 has 32 divisors (see below), whose sum is σ = 15182680579200. Its totient is φ = 7373478816000.
The previous prime is 11223041143319. The next prime is 11223041143343. The reversal of 11223041143341 is 14334114032211.
It is not a de Polignac number, because 11223041143341 - 25 = 11223041143309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11223041143299 and 11223041143308.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11223041143343) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 61388335 + ... + 61570883.
It is an arithmetic number, because the mean of its divisors is an integer number (474458768100).
Almost surely, 211223041143341 is an apocalyptic number.
It is an amenable number.
11223041143341 is a deficient number, since it is larger than the sum of its proper divisors (3959639435859).
11223041143341 is a wasteful number, since it uses less digits than its factorization.
11223041143341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183597.
The product of its (nonzero) digits is 6912, while the sum is 30.
Adding to 11223041143341 its reverse (14334114032211), we get a palindrome (25557155175552).
The spelling of 11223041143341 in words is "eleven trillion, two hundred twenty-three billion, forty-one million, one hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •