Base | Representation |
---|---|
bin | 11011101010011… |
… | …11010110101100 |
3 | 121011122212221010 |
4 | 31311033112230 |
5 | 433401412312 |
6 | 35005505220 |
7 | 5515323510 |
oct | 1565172654 |
9 | 534585833 |
10 | 232060332 |
11 | 109aa03a9 |
12 | 65872210 |
13 | 3910100a |
14 | 22b6a140 |
15 | 1558d93c |
hex | dd4f5ac |
232060332 has 48 divisors (see below), whose sum is σ = 621807872. Its totient is φ = 65983680.
The previous prime is 232060331. The next prime is 232060373. The reversal of 232060332 is 233060232.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 232060299 and 232060308.
It is not an unprimeable number, because it can be changed into a prime (232060331) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11178 + ... + 24270.
Almost surely, 2232060332 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 232060332, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (310903936).
232060332 is an abundant number, since it is smaller than the sum of its proper divisors (389747540).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232060332 is a wasteful number, since it uses less digits than its factorization.
232060332 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13318 (or 13316 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 21.
The square root of 232060332 is about 15233.5265779136. The cubic root of 232060332 is about 614.5166246065.
The spelling of 232060332 in words is "two hundred thirty-two million, sixty thousand, three hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •