Base | Representation |
---|---|
bin | 1010001000100110111100… |
… | …1110000110001110100000 |
3 | 1110110021001121022221001212 |
4 | 2202021233032012032200 |
5 | 2430031341322213240 |
6 | 35411010104245252 |
7 | 2230025126562134 |
oct | 242115716061640 |
9 | 43407047287055 |
10 | 11143011132320 |
11 | 36067a7317361 |
12 | 12bb70ba70828 |
13 | 62aa20a97642 |
14 | 2a7478a673c4 |
15 | 144cc691d165 |
hex | a226f3863a0 |
11143011132320 has 24 divisors (see below), whose sum is σ = 26325363800484. Its totient is φ = 4457204452864.
The previous prime is 11143011132301. The next prime is 11143011132367. The reversal of 11143011132320 is 2323111034111.
It can be written as a sum of positive squares in 2 ways, for example, as 10426001860624 + 717009271696 = 3228932^2 + 846764^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 34821909629 + ... + 34821909948.
Almost surely, 211143011132320 is an apocalyptic number.
11143011132320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
11143011132320 is an abundant number, since it is smaller than the sum of its proper divisors (15182352668164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11143011132320 is an equidigital number, since it uses as much as digits as its factorization.
11143011132320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69643819592 (or 69643819584 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 23.
Adding to 11143011132320 its reverse (2323111034111), we get a palindrome (13466122166431).
The spelling of 11143011132320 in words is "eleven trillion, one hundred forty-three billion, eleven million, one hundred thirty-two thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •