Base | Representation |
---|---|
bin | 11011101110101… |
… | …00000111111000 |
3 | 121012200111220121 |
4 | 31313110013320 |
5 | 434021313102 |
6 | 35025303024 |
7 | 5523050134 |
oct | 1567240770 |
9 | 535614817 |
10 | 232604152 |
11 | 10a331a40 |
12 | 65a94a74 |
13 | 392616c1 |
14 | 22c6c3c4 |
15 | 15649b37 |
hex | ddd41f8 |
232604152 has 64 divisors (see below), whose sum is σ = 508757760. Its totient is φ = 98630400.
The previous prime is 232604143. The next prime is 232604161. The reversal of 232604152 is 251406232.
It is an interprime number because it is at equal distance from previous prime (232604143) and next prime (232604161).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81583 + ... + 84385.
It is an arithmetic number, because the mean of its divisors is an integer number (7949340).
Almost surely, 2232604152 is an apocalyptic number.
232604152 is a gapful number since it is divisible by the number (22) 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 232604152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (254378880).
232604152 is an abundant number, since it is smaller than the sum of its proper divisors (276153608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232604152 is a wasteful number, since it uses less digits than its factorization.
232604152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2884 (or 2880 counting only the distinct ones).
The product of its (nonzero) digits is 2880, while the sum is 25.
The square root of 232604152 is about 15251.3655782032. The cubic root of 232604152 is about 614.9962782069.
The spelling of 232604152 in words is "two hundred thirty-two million, six hundred four thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •