Base | Representation |
---|---|
bin | 1010000010101011101110… |
… | …0101100011010011011000 |
3 | 1110002112022010102210212021 |
4 | 2200222323211203103120 |
5 | 2421344401030242130 |
6 | 35252132512024224 |
7 | 2216462361064135 |
oct | 240527345432330 |
9 | 43075263383767 |
10 | 11041213134040 |
11 | 3577608a74571 |
12 | 12a3a3bb32074 |
13 | 621249918cbb |
14 | 2a257ccd158c |
15 | 14231992337a |
hex | a0abb9634d8 |
11041213134040 has 16 divisors (see below), whose sum is σ = 24842729551680. Its totient is φ = 4416485253600.
The previous prime is 11041213134013. The next prime is 11041213134059. The reversal of 11041213134040 is 4043131214011.
It is a junction number, because it is equal to n+sod(n) for n = 11041213133996 and 11041213134014.
It is a congruent number.
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, 138015164136 + ... + 138015164215.
It is an arithmetic number, because the mean of its divisors is an integer number (1552670596980).
Almost surely, 211041213134040 is an apocalyptic number.
11041213134040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11041213134040 is an abundant number, since it is smaller than the sum of its proper divisors (13801516417640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11041213134040 is a wasteful number, since it uses less digits than its factorization.
11041213134040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 276030328362 (or 276030328358 counting only the distinct ones).
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 11041213134040 its reverse (4043131214011), we get a palindrome (15084344348051).
The spelling of 11041213134040 in words is "eleven trillion, forty-one billion, two hundred thirteen million, one hundred thirty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •