Base | Representation |
---|---|
bin | 11100100011001… |
… | …01010110000000 |
3 | 121200122101010000 |
4 | 32101211112000 |
5 | 442302143212 |
6 | 35433040000 |
7 | 5635430556 |
oct | 1621452600 |
9 | 550571100 |
10 | 239490432 |
11 | 113205785 |
12 | 68256000 |
13 | 3a802c1c |
14 | 23b41bd6 |
15 | 1605a1dc |
hex | e465580 |
239490432 has 80 divisors (see below), whose sum is σ = 712750500. Its totient is φ = 79826688.
The previous prime is 239490413. The next prime is 239490451. The reversal of 239490432 is 234094932.
It is an interprime number because it is at equal distance from previous prime (239490413) and next prime (239490451).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
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 9 ways as a sum of consecutive naturals, for example, 1182 + ... + 21917.
Almost surely, 2239490432 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 239490432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (356375250).
239490432 is an abundant number, since it is smaller than the sum of its proper divisors (473260068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
239490432 is an equidigital number, since it uses as much as digits as its factorization.
239490432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23125 (or 23104 counting only the distinct ones).
The product of its (nonzero) digits is 46656, while the sum is 36.
The square root of 239490432 is about 15475.4784094063. The cubic root of 239490432 is about 621.0063711452.
The spelling of 239490432 in words is "two hundred thirty-nine million, four hundred ninety thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •