Base | Representation |
---|---|
bin | 1101011010000101101… |
… | …0010101110000000101 |
3 | 211000112212210120222112 |
4 | 3112201122111300011 |
5 | 12233214333201201 |
6 | 253452313310405 |
7 | 22433033526134 |
oct | 3264132256005 |
9 | 730485716875 |
10 | 230341303301 |
11 | 8976172a47a |
12 | 38784a05405 |
13 | 1894b313b95 |
14 | b2119b191b |
15 | 5ed201a0bb |
hex | 35a1695c05 |
230341303301 has 2 divisors, whose sum is σ = 230341303302. Its totient is φ = 230341303300.
The previous prime is 230341303261. The next prime is 230341303303. The reversal of 230341303301 is 103303143032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 175017559201 + 55323744100 = 418351^2 + 235210^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230341303301 is a prime.
Together with 230341303303, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230341303303) 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, 115170651650 + 115170651651.
It is an arithmetic number, because the mean of its divisors is an integer number (115170651651).
Almost surely, 2230341303301 is an apocalyptic number.
It is an amenable number.
230341303301 is a deficient number, since it is larger than the sum of its proper divisors (1).
230341303301 is an equidigital number, since it uses as much as digits as its factorization.
230341303301 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1944, while the sum is 23.
Adding to 230341303301 its reverse (103303143032), we get a palindrome (333644446333).
The spelling of 230341303301 in words is "two hundred thirty billion, three hundred forty-one million, three hundred three thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •