Base | Representation |
---|---|
bin | 1010000011011001111011… |
… | …0111010001001101001100 |
3 | 1110010201022111212212000022 |
4 | 2200312132313101031030 |
5 | 2422100301213004012 |
6 | 35301543335321312 |
7 | 2220411624645515 |
oct | 240663667211514 |
9 | 43121274785008 |
10 | 11053616141132 |
11 | 35818a3165354 |
12 | 12a6321820238 |
13 | 622475405a56 |
14 | 2a2dd8257a0c |
15 | 1427e374d472 |
hex | a0d9edd134c |
11053616141132 has 12 divisors (see below), whose sum is σ = 19355418329520. Its totient is φ = 5523496618416.
The previous prime is 11053616141101. The next prime is 11053616141177. The reversal of 11053616141132 is 23114161635011.
11053616141132 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a junction number, because it is equal to n+sod(n) for n = 11053616141092 and 11053616141101.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 827855528 + ... + 827868879.
It is an arithmetic number, because the mean of its divisors is an integer number (1612951527460).
Almost surely, 211053616141132 is an apocalyptic number.
It is an amenable number.
11053616141132 is a deficient number, since it is larger than the sum of its proper divisors (8301802188388).
11053616141132 is a wasteful number, since it uses less digits than its factorization.
11053616141132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1655726080 (or 1655726078 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 35.
Adding to 11053616141132 its reverse (23114161635011), we get a palindrome (34167777776143).
The spelling of 11053616141132 in words is "eleven trillion, fifty-three billion, six hundred sixteen million, one hundred forty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •