Base | Representation |
---|---|
bin | 11011100000010… |
… | …10100110000001 |
3 | 121002011022012202 |
4 | 31300022212001 |
5 | 433031330423 |
6 | 34521202545 |
7 | 5501113355 |
oct | 1560124601 |
9 | 532138182 |
10 | 230730113 |
11 | 109271a49 |
12 | 65330455 |
13 | 38a566c3 |
14 | 22901465 |
15 | 153c9728 |
hex | dc0a981 |
230730113 has 4 divisors (see below), whose sum is σ = 236966100. Its totient is φ = 224494128.
The previous prime is 230730109. The next prime is 230730127. The reversal of 230730113 is 311037032.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 213656689 + 17073424 = 14617^2 + 4132^2 .
It is a cyclic number.
It is not a de Polignac number, because 230730113 - 22 = 230730109 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (230730133) 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 3 ways as a sum of consecutive naturals, for example, 3117938 + ... + 3118011.
It is an arithmetic number, because the mean of its divisors is an integer number (59241525).
Almost surely, 2230730113 is an apocalyptic number.
It is an amenable number.
230730113 is a deficient number, since it is larger than the sum of its proper divisors (6235987).
230730113 is an equidigital number, since it uses as much as digits as its factorization.
230730113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6235986.
The product of its (nonzero) digits is 378, while the sum is 20.
The square root of 230730113 is about 15189.8029282805. The cubic root of 230730113 is about 613.3401940461.
Adding to 230730113 its reverse (311037032), we get a palindrome (541767145).
The spelling of 230730113 in words is "two hundred thirty million, seven hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •