Base | Representation |
---|---|
bin | 11011101111011… |
… | …00000010000000 |
3 | 121012212111020120 |
4 | 31313230002000 |
5 | 434032431310 |
6 | 35031340240 |
7 | 5523635502 |
oct | 1567540200 |
9 | 535774216 |
10 | 232702080 |
11 | 10a399576 |
12 | 65b21680 |
13 | 39297150 |
14 | 22c95d72 |
15 | 15668b70 |
hex | ddec080 |
232702080 has 128 divisors (see below), whose sum is σ = 798880320. Its totient is φ = 57274368.
The previous prime is 232702079. The next prime is 232702097. The reversal of 232702080 is 80207232.
It is a tau number, because it is divible by the number of its divisors (128).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a self number, because there is not a number n which added to its sum of digits gives 232702080.
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, 20299 + ... + 29621.
Almost surely, 2232702080 is an apocalyptic number.
232702080 is a gapful number since it is divisible by the number (20) 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 232702080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (399440160).
232702080 is an abundant number, since it is smaller than the sum of its proper divisors (566178240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232702080 is a wasteful number, since it uses less digits than its factorization.
232702080 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9358 (or 9346 counting only the distinct ones).
The product of its (nonzero) digits is 1344, while the sum is 24.
The square root of 232702080 is about 15254.5757069805. The cubic root of 232702080 is about 615.0825720316.
The spelling of 232702080 in words is "two hundred thirty-two million, seven hundred two thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •