Base | Representation |
---|---|
bin | 1010000010110110101011… |
… | …1001010000101000011001 |
3 | 1110002210220002210012020021 |
4 | 2200231222321100220121 |
5 | 2421421412001010431 |
6 | 35253340415430441 |
7 | 2216625303513460 |
oct | 240555271205031 |
9 | 43083802705207 |
10 | 11044154313241 |
11 | 3578888209a85 |
12 | 12a4520b25421 |
13 | 6215c807721a |
14 | 2a277b7859d7 |
15 | 14243cc48b11 |
hex | a0b6ae50a19 |
11044154313241 has 16 divisors (see below), whose sum is σ = 13366386495360. Its totient is φ = 8908215402240.
The previous prime is 11044154313239. The next prime is 11044154313251. The reversal of 11044154313241 is 14231345144011.
It is not a de Polignac number, because 11044154313241 - 21 = 11044154313239 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11044154313197 and 11044154313206.
It is not an unprimeable number, because it can be changed into a prime (11044154313211) 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 15 ways as a sum of consecutive naturals, for example, 6268071 + ... + 7834348.
It is an arithmetic number, because the mean of its divisors is an integer number (835399155960).
Almost surely, 211044154313241 is an apocalyptic number.
It is an amenable number.
11044154313241 is a deficient number, since it is larger than the sum of its proper divisors (2322232182119).
11044154313241 is a wasteful number, since it uses less digits than its factorization.
11044154313241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14109024.
The product of its (nonzero) digits is 23040, while the sum is 34.
Adding to 11044154313241 its reverse (14231345144011), we get a palindrome (25275499457252).
The spelling of 11044154313241 in words is "eleven trillion, forty-four billion, one hundred fifty-four million, three hundred thirteen thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •