Base | Representation |
---|---|
bin | 1010000101001011000100… |
… | …0001000010110101000100 |
3 | 1110020121201000010100000000 |
4 | 2201102301001002311010 |
5 | 2423100000234332034 |
6 | 35323525043321300 |
7 | 2222535330642351 |
oct | 241226101026504 |
9 | 43217630110000 |
10 | 11083985464644 |
11 | 3593767921624 |
12 | 12b0198380230 |
13 | 6252a515b571 |
14 | 2a467975d628 |
15 | 1434be9cb599 |
hex | a14b1042d44 |
11083985464644 has 81 divisors (see below), whose sum is σ = 29095399407711. Its totient is φ = 3694482041400.
The previous prime is 11083985464633. The next prime is 11083985464667. The reversal of 11083985464644 is 44646458938011.
The square root of 11083985464644 is 3329262.
It is a perfect power (a square), and thus also a powerful number.
11083985464644 is a `hidden beast` number, since 1 + 1 + 0 + 8 + 3 + 9 + 8 + 546 + 46 + 44 = 666.
It is a tau number, because it is divible by the number of its divisors (81).
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 539330169 + ... + 539350719.
Almost surely, 211083985464644 is an apocalyptic number.
11083985464644 is the 3329262-nd square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 11083985464644
11083985464644 is an abundant number, since it is smaller than the sum of its proper divisors (18011413943067).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11083985464644 is an frugal number, since it uses more digits than its factorization.
11083985464644 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41130 (or 20556 counting only the distinct ones).
The product of its (nonzero) digits is 79626240, while the sum is 63.
The spelling of 11083985464644 in words is "eleven trillion, eighty-three billion, nine hundred eighty-five million, four hundred sixty-four thousand, six hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •