Base | Representation |
---|---|
bin | 1010001110011101011101… |
… | …1000110110110100001010 |
3 | 1110210212112211211112012112 |
4 | 2203213113120312310022 |
5 | 2433203234003443200 |
6 | 35525113511542322 |
7 | 2240214322611611 |
oct | 243472730666412 |
9 | 43725484745175 |
10 | 11243543031050 |
11 | 36453a5a16890 |
12 | 13170a798a9a2 |
13 | 63735284a455 |
14 | 2ac2945c4878 |
15 | 14770c6c2535 |
hex | a39d7636d0a |
11243543031050 has 48 divisors (see below), whose sum is σ = 23200851880800. Its totient is φ = 4019263444800.
The previous prime is 11243543031029. The next prime is 11243543031089. The reversal of 11243543031050 is 5013034534211.
It is a junction number, because it is equal to n+sod(n) for n = 11243543030998 and 11243543031016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 173211665 + ... + 173276564.
It is an arithmetic number, because the mean of its divisors is an integer number (483351080850).
Almost surely, 211243543031050 is an apocalyptic number.
11243543031050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11243543031050 is an abundant number, since it is smaller than the sum of its proper divisors (11957308849750).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11243543031050 is a wasteful number, since it uses less digits than its factorization.
11243543031050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346488311 (or 346488306 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
Adding to 11243543031050 its reverse (5013034534211), we get a palindrome (16256577565261).
The spelling of 11243543031050 in words is "eleven trillion, two hundred forty-three billion, five hundred forty-three million, thirty-one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •