Base | Representation |
---|---|
bin | 1010000001101100100010… |
… | …0100101010000001011000 |
3 | 1110000220112000102221011001 |
4 | 2200123020210222001120 |
5 | 2421110131242242130 |
6 | 35240245425314344 |
7 | 2215322135341114 |
oct | 240331044520130 |
9 | 43026460387131 |
10 | 11024251134040 |
11 | 35703a43aa951 |
12 | 12a06a74959b4 |
13 | 61c77576c001 |
14 | 2a18102a4744 |
15 | 141b757556ca |
hex | a06c892a058 |
11024251134040 has 16 divisors (see below), whose sum is σ = 24804565051680. Its totient is φ = 4409700453600.
The previous prime is 11024251133989. The next prime is 11024251134067. The reversal of 11024251134040 is 4043115242011.
It is a happy number.
It is a super-2 number, since 2×110242511340402 (a number of 27 digits) contains 22 as substring.
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, 137803139136 + ... + 137803139215.
It is an arithmetic number, because the mean of its divisors is an integer number (1550285315730).
Almost surely, 211024251134040 is an apocalyptic number.
11024251134040 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11024251134040 is an abundant number, since it is smaller than the sum of its proper divisors (13780313917640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11024251134040 is a wasteful number, since it uses less digits than its factorization.
11024251134040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 275606278362 (or 275606278358 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 11024251134040 its reverse (4043115242011), we get a palindrome (15067366376051).
The spelling of 11024251134040 in words is "eleven trillion, twenty-four billion, two hundred fifty-one million, one hundred thirty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.120 sec. • engine limits •