Base | Representation |
---|---|
bin | 1010000010110110001101… |
… | …0000101101010110011101 |
3 | 1110002210120011210112011001 |
4 | 2200231203100231112131 |
5 | 2421421131204224321 |
6 | 35253320002430301 |
7 | 2216622160106332 |
oct | 240554320552635 |
9 | 43083504715131 |
10 | 11044026242461 |
11 | 3578821995563 |
12 | 12a44a6062391 |
13 | 6215a76858b4 |
14 | 2a2768768989 |
15 | 14243189bc91 |
hex | a0b6342d59d |
11044026242461 has 2 divisors, whose sum is σ = 11044026242462. Its totient is φ = 11044026242460.
The previous prime is 11044026242429. The next prime is 11044026242497. The reversal of 11044026242461 is 16424262044011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5787782219961 + 5256244022500 = 2405781^2 + 2292650^2 .
It is a cyclic number.
It is not a de Polignac number, because 11044026242461 - 25 = 11044026242429 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11044026242461.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11044026242401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5522013121230 + 5522013121231.
It is an arithmetic number, because the mean of its divisors is an integer number (5522013121231).
Almost surely, 211044026242461 is an apocalyptic number.
It is an amenable number.
11044026242461 is a deficient number, since it is larger than the sum of its proper divisors (1).
11044026242461 is an equidigital number, since it uses as much as digits as its factorization.
11044026242461 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 73728, while the sum is 37.
Adding to 11044026242461 its reverse (16424262044011), we get a palindrome (27468288286472).
The spelling of 11044026242461 in words is "eleven trillion, forty-four billion, twenty-six million, two hundred forty-two thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •