Base | Representation |
---|---|
bin | 1010000111111010011001… |
… | …1011001011000100110000 |
3 | 1110102010012011212122020200 |
4 | 2201332212123023010300 |
5 | 2424332343403430130 |
6 | 35401311311235200 |
7 | 2226122566224051 |
oct | 241764633130460 |
9 | 43363164778220 |
10 | 11131052405040 |
11 | 360171a995577 |
12 | 12b9332b18b00 |
13 | 629866353a59 |
14 | 2a6a62710728 |
15 | 144826b01760 |
hex | a1fa66cb130 |
11131052405040 has 120 divisors (see below), whose sum is σ = 37536896050368. Its totient is φ = 2955964078080.
The previous prime is 11131052405029. The next prime is 11131052405071. The reversal of 11131052405040 is 4050425013111.
11131052405040 is a `hidden beast` number, since 1 + 1 + 13 + 105 + 2 + 40 + 504 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (120).
It is a junction number, because it is equal to n+sod(n) for n = 11131052404995 and 11131052405013.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 31900744 + ... + 32247783.
Almost surely, 211131052405040 is an apocalyptic number.
11131052405040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11131052405040 is an abundant number, since it is smaller than the sum of its proper divisors (26405843645328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11131052405040 is a wasteful number, since it uses less digits than its factorization.
11131052405040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64148787 (or 64148778 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
Adding to 11131052405040 its reverse (4050425013111), we get a palindrome (15181477418151).
The spelling of 11131052405040 in words is "eleven trillion, one hundred thirty-one billion, fifty-two million, four hundred five thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •