Base | Representation |
---|---|
bin | 11001110010100… |
… | …101010100000000 |
3 | 1010011011221200120 |
4 | 121302211110000 |
5 | 1341232043212 |
6 | 110534020240 |
7 | 13502544066 |
oct | 3162452400 |
9 | 1104157616 |
10 | 432690432 |
11 | 2022737a9 |
12 | 100aa7680 |
13 | 6b849055 |
14 | 41674036 |
15 | 27ebe88c |
hex | 19ca5500 |
432690432 has 72 divisors (see below), whose sum is σ = 1182789216. Its totient is φ = 140322816.
The previous prime is 432690407. The next prime is 432690449. The reversal of 432690432 is 234096234.
It is a junction number, because it is equal to n+sod(n) for n = 432690393 and 432690402.
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 7 ways as a sum of consecutive naturals, for example, 20803 + ... + 36029.
It is an arithmetic number, because the mean of its divisors is an integer number (16427628).
Almost surely, 2432690432 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 432690432, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (591394608).
432690432 is an abundant number, since it is smaller than the sum of its proper divisors (750098784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
432690432 is a wasteful number, since it uses less digits than its factorization.
432690432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15283 (or 15269 counting only the distinct ones).
The product of its (nonzero) digits is 31104, while the sum is 33.
The square root of 432690432 is about 20801.2122723653. The cubic root of 432690432 is about 756.3551423423.
The spelling of 432690432 in words is "four hundred thirty-two million, six hundred ninety thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •