Base | Representation |
---|---|
bin | 1011011010000111001001… |
… | …0000111100110001111000 |
3 | 1122102010020200021001121112 |
4 | 2312201302100330301320 |
5 | 3121002004204101300 |
6 | 42402135413055452 |
7 | 2433134503006325 |
oct | 266416220746170 |
9 | 48363220231545 |
10 | 12543221550200 |
11 | 3aa6606622720 |
12 | 14a6b63627588 |
13 | 6cca89165623 |
14 | 3151491a7b4c |
15 | 16b428293e35 |
hex | b687243cc78 |
12543221550200 has 96 divisors (see below), whose sum is σ = 31954322828160. Its totient is φ = 4541078025600.
The previous prime is 12543221550163. The next prime is 12543221550229. The reversal of 12543221550200 is 205512234521.
It is a super-2 number, since 2×125432215502002 (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 23 ways as a sum of consecutive naturals, for example, 12058892 + ... + 13057691.
It is an arithmetic number, because the mean of its divisors is an integer number (332857529460).
Almost surely, 212543221550200 is an apocalyptic number.
12543221550200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12543221550200 is an abundant number, since it is smaller than the sum of its proper divisors (19411101277960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12543221550200 is a wasteful number, since it uses less digits than its factorization.
12543221550200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25116837 (or 25116828 counting only the distinct ones).
The product of its (nonzero) digits is 24000, while the sum is 32.
Adding to 12543221550200 its reverse (205512234521), we get a palindrome (12748733784721).
The spelling of 12543221550200 in words is "twelve trillion, five hundred forty-three billion, two hundred twenty-one million, five hundred fifty thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •