Base | Representation |
---|---|
bin | 1010000011011000110011… |
… | …0011000111101000001100 |
3 | 1110010200112101120220120110 |
4 | 2200312030303013220030 |
5 | 2422044141121012221 |
6 | 35301453311320020 |
7 | 2220401254560210 |
oct | 240661463075014 |
9 | 43120471526513 |
10 | 11053313063436 |
11 | 3581758079616 |
12 | 12a6258220010 |
13 | 62242769b137 |
14 | 2a2da9cc2940 |
15 | 1427c6d32776 |
hex | a0d8ccc7a0c |
11053313063436 has 48 divisors (see below), whose sum is σ = 29476274526720. Its totient is φ = 3158006622720.
The previous prime is 11053313063431. The next prime is 11053313063447. The reversal of 11053313063436 is 63436031335011.
It is a junction number, because it is equal to n+sod(n) for n = 11053313063394 and 11053313063403.
It is not an unprimeable number, because it can be changed into a prime (11053313063431) 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, 1532905 + ... + 4945343.
It is an arithmetic number, because the mean of its divisors is an integer number (614089052640).
Almost surely, 211053313063436 is an apocalyptic number.
It is an amenable number.
11053313063436 is an abundant number, since it is smaller than the sum of its proper divisors (18422961463284).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11053313063436 is a wasteful number, since it uses less digits than its factorization.
11053313063436 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3451014 (or 3451012 counting only the distinct ones).
The product of its (nonzero) digits is 174960, while the sum is 39.
Adding to 11053313063436 its reverse (63436031335011), we get a palindrome (74489344398447).
The spelling of 11053313063436 in words is "eleven trillion, fifty-three billion, three hundred thirteen million, sixty-three thousand, four hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •