Base | Representation |
---|---|
bin | 11011011101000… |
… | …10111101100101 |
3 | 121001100201221102 |
4 | 31232202331211 |
5 | 432424240022 |
6 | 34504125445 |
7 | 5464365002 |
oct | 1556427545 |
9 | 531321842 |
10 | 230305637 |
11 | 109002041 |
12 | 65166885 |
13 | 38938433 |
14 | 228308a9 |
15 | 15343a92 |
hex | dba2f65 |
230305637 has 2 divisors, whose sum is σ = 230305638. Its totient is φ = 230305636.
The previous prime is 230305609. The next prime is 230305643. The reversal of 230305637 is 736503032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 222188836 + 8116801 = 14906^2 + 2849^2 .
It is a cyclic number.
It is not a de Polignac number, because 230305637 - 26 = 230305573 is a prime.
It is a Chen prime.
It is equal to p12658421 and since 230305637 and 12658421 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230305657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115152818 + 115152819.
It is an arithmetic number, because the mean of its divisors is an integer number (115152819).
Almost surely, 2230305637 is an apocalyptic number.
It is an amenable number.
230305637 is a deficient number, since it is larger than the sum of its proper divisors (1).
230305637 is an equidigital number, since it uses as much as digits as its factorization.
230305637 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11340, while the sum is 29.
The square root of 230305637 is about 15175.8240962394. The cubic root of 230305637 is about 612.9638409019.
Adding to 230305637 its reverse (736503032), we get a palindrome (966808669).
The spelling of 230305637 in words is "two hundred thirty million, three hundred five thousand, six hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •