Base | Representation |
---|---|
bin | 1110001001110101011… |
… | …1001010101010000000 |
3 | 212020122010011200100020 |
4 | 3202131113022222000 |
5 | 12440442003430243 |
6 | 303412205253440 |
7 | 23365455100611 |
oct | 3423527125200 |
9 | 766563150306 |
10 | 243158264448 |
11 | 94139557050 |
12 | 3b161264280 |
13 | 19c117b9768 |
14 | baa9cd1c08 |
15 | 64d2363283 |
hex | 389d5caa80 |
243158264448 has 512 divisors, whose sum is σ = 760015872000. Its totient is φ = 68105318400.
The previous prime is 243158264387. The next prime is 243158264501. The reversal of 243158264448 is 844462851342.
It is a self number, because there is not a number n which added to its sum of digits gives 243158264448.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 792046311 + ... + 792046617.
It is an arithmetic number, because the mean of its divisors is an integer number (1484406000).
Almost surely, 2243158264448 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 243158264448, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (380007936000).
243158264448 is an abundant number, since it is smaller than the sum of its proper divisors (516857607552).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243158264448 is a wasteful number, since it uses less digits than its factorization.
243158264448 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564 (or 552 counting only the distinct ones).
The product of its digits is 5898240, while the sum is 51.
The spelling of 243158264448 in words is "two hundred forty-three billion, one hundred fifty-eight million, two hundred sixty-four thousand, four hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •