Base | Representation |
---|---|
bin | 11100111110101… |
… | …00010000000000 |
3 | 121221102021101100 |
4 | 32133110100000 |
5 | 444212343212 |
6 | 40042134400 |
7 | 6011143314 |
oct | 1637242000 |
9 | 557367340 |
10 | 243090432 |
11 | 115244492 |
12 | 694b1400 |
13 | 3b4936c0 |
14 | 243dbb44 |
15 | 1651bbdc |
hex | e7d4400 |
243090432 has 132 divisors (see below), whose sum is σ = 756284620. Its totient is φ = 74760192.
The previous prime is 243090409. The next prime is 243090457. The reversal of 243090432 is 234090342.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 158155776 + 84934656 = 12576^2 + 9216^2 .
It is a junction number, because it is equal to n+sod(n) for n = 243090396 and 243090405.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 118794 + ... + 120822.
Almost surely, 2243090432 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 243090432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (378142310).
243090432 is an abundant number, since it is smaller than the sum of its proper divisors (513194188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
243090432 is a wasteful number, since it uses less digits than its factorization.
243090432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2068 (or 2047 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 243090432 is about 15591.3576060586. The cubic root of 243090432 is about 624.1025472492.
The spelling of 243090432 in words is "two hundred forty-three million, ninety thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •