Base | Representation |
---|---|
bin | 1010000010110100001111… |
… | …1010000110000001111111 |
3 | 1110002202012111222211201210 |
4 | 2200231003322012001333 |
5 | 2421414042024024133 |
6 | 35253151452135503 |
7 | 2216603142022620 |
oct | 240550372060177 |
9 | 43082174884653 |
10 | 11043500220543 |
11 | 3578581a754aa |
12 | 12a4379a67593 |
13 | 6215226bc41b |
14 | 2a271895ba47 |
15 | 1424005e3763 |
hex | a0b43e8607f |
11043500220543 has 16 divisors (see below), whose sum is σ = 16828501685760. Its totient is φ = 6310454977056.
The previous prime is 11043500220503. The next prime is 11043500220587. The reversal of 11043500220543 is 34502200534011.
It is not a de Polignac number, because 11043500220543 - 216 = 11043500155007 is a prime.
It is a super-2 number, since 2×110435002205432 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11043500220543.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11043500220503) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3687003 + ... + 5973356.
It is an arithmetic number, because the mean of its divisors is an integer number (1051781355360).
Almost surely, 211043500220543 is an apocalyptic number.
11043500220543 is a deficient number, since it is larger than the sum of its proper divisors (5785001465217).
11043500220543 is an equidigital number, since it uses as much as digits as its factorization.
11043500220543 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9714806.
The product of its (nonzero) digits is 14400, while the sum is 30.
Adding to 11043500220543 its reverse (34502200534011), we get a palindrome (45545700754554).
The spelling of 11043500220543 in words is "eleven trillion, forty-three billion, five hundred million, two hundred twenty thousand, five hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •