Base | Representation |
---|---|
bin | 11001110000001… |
… | …001000001000000 |
3 | 1010002222102111202 |
4 | 121300021001000 |
5 | 1341101101430 |
6 | 110512200332 |
7 | 13464236456 |
oct | 3160110100 |
9 | 1102872452 |
10 | 432050240 |
11 | 201976816 |
12 | 1008390a8 |
13 | 6b68383b |
14 | 415489d6 |
15 | 27de4d45 |
hex | 19c09040 |
432050240 has 112 divisors (see below), whose sum is σ = 1115275392. Its totient is φ = 158785536.
The previous prime is 432050231. The next prime is 432050243. The reversal of 432050240 is 42050234.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is not an unprimeable number, because it can be changed into a prime (432050243) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 232997 + ... + 234843.
It is an arithmetic number, because the mean of its divisors is an integer number (9957816).
Almost surely, 2432050240 is an apocalyptic number.
432050240 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 432050240, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (557637696).
432050240 is an abundant number, since it is smaller than the sum of its proper divisors (683225152).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
432050240 is a wasteful number, since it uses less digits than its factorization.
432050240 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1924 (or 1914 counting only the distinct ones).
The product of its (nonzero) digits is 960, while the sum is 20.
The square root of 432050240 is about 20785.8182422535. The cubic root of 432050240 is about 755.9819336313.
The spelling of 432050240 in words is "four hundred thirty-two million, fifty thousand, two hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •