Base | Representation |
---|---|
bin | 11100111110000… |
… | …10001110111000 |
3 | 121221021112011000 |
4 | 32133002032320 |
5 | 444203013012 |
6 | 40040405000 |
7 | 6010415205 |
oct | 1637021670 |
9 | 557245130 |
10 | 243016632 |
11 | 1151a3aa1 |
12 | 69476760 |
13 | 3b468c31 |
14 | 243bccac |
15 | 16504ddc |
hex | e7c23b8 |
243016632 has 128 divisors (see below), whose sum is σ = 720360000. Its totient is φ = 75907584.
The previous prime is 243016603. The next prime is 243016651. The reversal of 243016632 is 236610342.
243016632 is a `hidden beast` number, since 24 + 3 + 0 + 1 + 6 + 632 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 243016596 and 243016605.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1061094 + ... + 1061322.
Almost surely, 2243016632 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 243016632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (360180000).
243016632 is an abundant number, since it is smaller than the sum of its proper divisors (477343368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243016632 is a wasteful number, since it uses less digits than its factorization.
243016632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 295 (or 251 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 243016632 is about 15588.9907306406. The cubic root of 243016632 is about 624.0393836089.
Adding to 243016632 its reverse (236610342), we get a palindrome (479626974).
The spelling of 243016632 in words is "two hundred forty-three million, sixteen thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •