Base | Representation |
---|---|
bin | 1101011010101100010… |
… | …0110100001111110000 |
3 | 211000222011212122101121 |
4 | 3112223010310033300 |
5 | 12234032334330300 |
6 | 253520344312024 |
7 | 22440042566065 |
oct | 3265304641760 |
9 | 730864778347 |
10 | 230503433200 |
11 | 898351a7027 |
12 | 3880b172614 |
13 | 18975a9bc31 |
14 | b229336c6c |
15 | 5ee139381a |
hex | 35ab1343f0 |
230503433200 has 60 divisors (see below), whose sum is σ = 577862108208. Its totient is φ = 88192614400.
The previous prime is 230503433159. The next prime is 230503433213. The reversal of 230503433200 is 2334305032.
230503433200 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12518161 + ... + 12536560.
Almost surely, 2230503433200 is an apocalyptic number.
230503433200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
230503433200 is an abundant number, since it is smaller than the sum of its proper divisors (347358675008).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
230503433200 is a wasteful number, since it uses less digits than its factorization.
230503433200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25054762 (or 25054751 counting only the distinct ones).
The product of its (nonzero) digits is 6480, while the sum is 25.
Adding to 230503433200 its reverse (2334305032), we get a palindrome (232837738232).
The spelling of 230503433200 in words is "two hundred thirty billion, five hundred three million, four hundred thirty-three thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •