Base | Representation |
---|---|
bin | 1110001001110001111… |
… | …0001111111111110000 |
3 | 212020121002002122111012 |
4 | 3202130132033333300 |
5 | 12440424144002422 |
6 | 303410513410052 |
7 | 23365214216234 |
oct | 3423436177760 |
9 | 766532078435 |
10 | 243143344112 |
11 | 94131096199 |
12 | 3b158269928 |
13 | 19c0b694466 |
14 | baa7d2a5c4 |
15 | 64d0db74e2 |
hex | 389c78fff0 |
243143344112 has 80 divisors (see below), whose sum is σ = 501099594240. Its totient is φ = 114047467776.
The previous prime is 243143344099. The next prime is 243143344139. The reversal of 243143344112 is 211443341342.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 5624693 + ... + 5667755.
It is an arithmetic number, because the mean of its divisors is an integer number (6263744928).
Almost surely, 2243143344112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 243143344112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (250549797120).
243143344112 is an abundant number, since it is smaller than the sum of its proper divisors (257956250128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243143344112 is a wasteful number, since it uses less digits than its factorization.
243143344112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 43390 (or 43384 counting only the distinct ones).
The product of its digits is 27648, while the sum is 32.
Adding to 243143344112 its reverse (211443341342), we get a palindrome (454586685454).
The spelling of 243143344112 in words is "two hundred forty-three billion, one hundred forty-three million, three hundred forty-four thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •