Base | Representation |
---|---|
bin | 11011110000111… |
… | …00110101110000 |
3 | 121020020122111000 |
4 | 31320130311300 |
5 | 434110331000 |
6 | 35035522000 |
7 | 5525430402 |
oct | 1570346560 |
9 | 536218430 |
10 | 232902000 |
11 | 10a5157a1 |
12 | 65bb9300 |
13 | 39337146 |
14 | 22d08b72 |
15 | 156a8000 |
hex | de1cd70 |
232902000 has 320 divisors, whose sum is σ = 882086400. Its totient is φ = 58579200.
The previous prime is 232901993. The next prime is 232902001. The reversal of 232902000 is 209232.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (232902001) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 1025887 + ... + 1026113.
It is an arithmetic number, because the mean of its divisors is an integer number (2756520).
Almost surely, 2232902000 is an apocalyptic number.
232902000 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 232902000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (441043200).
232902000 is an abundant number, since it is smaller than the sum of its proper divisors (649184400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
232902000 is a wasteful number, since it uses less digits than its factorization.
232902000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 278 (or 256 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 18.
The square root of 232902000 is about 15261.1270881282. The cubic root of 232902000 is about 615.2586657303.
The spelling of 232902000 in words is "two hundred thirty-two million, nine hundred two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •