Base | Representation |
---|---|
bin | 1010000010000111100011… |
… | …0010100010111110111100 |
3 | 1110001121020101020010211212 |
4 | 2200201320302202332330 |
5 | 2421220004122020130 |
6 | 35243445144103552 |
7 | 2215666626245450 |
oct | 240417062427674 |
9 | 43047211203755 |
10 | 11031502532540 |
11 | 3573485652976 |
12 | 12a1b8ba64bb8 |
13 | 62035cb87059 |
14 | 2a1cdb382660 |
15 | 141e4c17ce95 |
hex | a0878ca2fbc |
11031502532540 has 24 divisors (see below), whose sum is σ = 26475606078432. Its totient is φ = 3782229439680.
The previous prime is 11031502532513. The next prime is 11031502532579. The reversal of 11031502532540 is 4523520513011.
It is a junction number, because it is equal to n+sod(n) for n = 11031502532497 and 11031502532506.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 39398223191 + ... + 39398223470.
It is an arithmetic number, because the mean of its divisors is an integer number (1103150253268).
Almost surely, 211031502532540 is an apocalyptic number.
11031502532540 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11031502532540 is an abundant number, since it is smaller than the sum of its proper divisors (15444103545892).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11031502532540 is a wasteful number, since it uses less digits than its factorization.
11031502532540 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78796446677 (or 78796446675 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 32.
The spelling of 11031502532540 in words is "eleven trillion, thirty-one billion, five hundred two million, five hundred thirty-two thousand, five hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.099 sec. • engine limits •