Base | Representation |
---|---|
bin | 11011011111000… |
… | …01000100000000 |
3 | 121001211122212021 |
4 | 31233201010000 |
5 | 433010410000 |
6 | 34513411224 |
7 | 5466504406 |
oct | 1557410400 |
9 | 531748767 |
10 | 230560000 |
11 | 109166160 |
12 | 65269b14 |
13 | 389c7148 |
14 | 22899476 |
15 | 1539411a |
hex | dbe1100 |
230560000 has 180 divisors, whose sum is σ = 632160144. Its totient is φ = 83200000.
The previous prime is 230559997. The next prime is 230560009. The reversal of 230560000 is 65032.
It is a Harshad number since it is a multiple of its sum of digits (16).
It is not an unprimeable number, because it can be changed into a prime (230560009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 1759935 + ... + 1760065.
Almost surely, 2230560000 is an apocalyptic number.
230560000 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 230560000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (316080072).
230560000 is an abundant number, since it is smaller than the sum of its proper divisors (401600144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230560000 is an equidigital number, since it uses as much as digits as its factorization.
230560000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 178 (or 149 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 16.
The square root of 230560000 is about 15184.2023168818. The cubic root of 230560000 is about 613.1894222323.
The spelling of 230560000 in words is "two hundred thirty million, five hundred sixty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •