Base | Representation |
---|---|
bin | 1101011010000001000… |
… | …1111011111100000011 |
3 | 211000111120002022011221 |
4 | 3112200101323330003 |
5 | 12233200003320303 |
6 | 253450354415511 |
7 | 22432413305440 |
oct | 3264021737403 |
9 | 730446068157 |
10 | 230322323203 |
11 | 89751a46445 |
12 | 3877a591597 |
13 | 189473c9a5b |
14 | b20d2709c7 |
15 | 5ed051b4bd |
hex | 35a047bf03 |
230322323203 has 8 divisors (see below), whose sum is σ = 277079486720. Its totient is φ = 187028653320.
The previous prime is 230322323177. The next prime is 230322323227. The reversal of 230322323203 is 302323223032.
230322323203 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230322323203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (230322323243) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 865873263 + ... + 865873528.
It is an arithmetic number, because the mean of its divisors is an integer number (34634935840).
Almost surely, 2230322323203 is an apocalyptic number.
230322323203 is a deficient number, since it is larger than the sum of its proper divisors (46757163517).
230322323203 is a wasteful number, since it uses less digits than its factorization.
230322323203 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1731746817.
The product of its (nonzero) digits is 7776, while the sum is 25.
Adding to 230322323203 its reverse (302323223032), we get a palindrome (532645546235).
The spelling of 230322323203 in words is "two hundred thirty billion, three hundred twenty-two million, three hundred twenty-three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •