Base | Representation |
---|---|
bin | 11011101101110… |
… | …00110000000000 |
3 | 121012110211010000 |
4 | 31312320300000 |
5 | 434004221112 |
6 | 35023040000 |
7 | 5522102223 |
oct | 1566706000 |
9 | 535424100 |
10 | 232492032 |
11 | 10a265783 |
12 | 65a40000 |
13 | 39222666 |
14 | 22c3d5ba |
15 | 156267dc |
hex | ddb8c00 |
232492032 has 110 divisors (see below), whose sum is σ = 694514348. Its totient is φ = 77469696.
The previous prime is 232492031. The next prime is 232492049. The reversal of 232492032 is 230294232.
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 = 232491987 and 232492005.
It is not an unprimeable number, because it can be changed into a prime (232492031) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 81543 + ... + 84345.
Almost surely, 2232492032 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 232492032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (347257174).
232492032 is an abundant number, since it is smaller than the sum of its proper divisors (462022316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232492032 is an equidigital number, since it uses as much as digits as its factorization.
232492032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2835 (or 2808 counting only the distinct ones).
The product of its (nonzero) digits is 5184, while the sum is 27.
The square root of 232492032 is about 15247.6893987253. The cubic root of 232492032 is about 614.8974486947.
It can be divided in two parts, 23249 and 2032, that added together give a square (25281 = 1592).
The spelling of 232492032 in words is "two hundred thirty-two million, four hundred ninety-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •