Base | Representation |
---|---|
bin | 1010000010110100110110… |
… | …0100111001001100100001 |
3 | 1110002202121211020012021112 |
4 | 2200231031210321030201 |
5 | 2421414410040410410 |
6 | 35253215525033105 |
7 | 2216610151564436 |
oct | 240551544711441 |
9 | 43082554205245 |
10 | 11043662435105 |
11 | 357865559a723 |
12 | 12a4404255795 |
13 | 62154a1a6b81 |
14 | 2a2732305b8d |
15 | 14240e987105 |
hex | a0b4d939321 |
11043662435105 has 16 divisors (see below), whose sum is σ = 14063199166800. Its totient is φ = 8296708718592.
The previous prime is 11043662435089. The next prime is 11043662435119. The reversal of 11043662435105 is 50153426634011.
It can be written as a sum of positive squares in 8 ways, for example, as 67806076816 + 10975856358289 = 260396^2 + 3312983^2 .
It is a cyclic number.
It is not a de Polignac number, because 11043662435105 - 24 = 11043662435089 is a prime.
It is a super-2 number, since 2×110436624351052 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is an unprimeable number.
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, 144644954 + ... + 144721283.
It is an arithmetic number, because the mean of its divisors is an integer number (878949947925).
Almost surely, 211043662435105 is an apocalyptic number.
It is an amenable number.
11043662435105 is a deficient number, since it is larger than the sum of its proper divisors (3019536731695).
11043662435105 is a wasteful number, since it uses less digits than its factorization.
11043662435105 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289366708.
The product of its (nonzero) digits is 259200, while the sum is 41.
The spelling of 11043662435105 in words is "eleven trillion, forty-three billion, six hundred sixty-two million, four hundred thirty-five thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •