Base | Representation |
---|---|
bin | 1101011010000011000… |
… | …0011010000111001101 |
3 | 211000112010010010112121 |
4 | 3112200300122013031 |
5 | 12233204024423432 |
6 | 253451241532541 |
7 | 22432541225014 |
oct | 3264060320715 |
9 | 730463103477 |
10 | 230330311117 |
11 | 89756501925 |
12 | 387811a4151 |
13 | 18948c6582a |
14 | b21034da7b |
15 | 5ed1098197 |
hex | 35a0c1a1cd |
230330311117 has 2 divisors, whose sum is σ = 230330311118. Its totient is φ = 230330311116.
The previous prime is 230330311103. The next prime is 230330311153. The reversal of 230330311117 is 711113033032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 120083733961 + 110246577156 = 346531^2 + 332034^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-230330311117 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 230330311091 and 230330311100.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230330311157) 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, 115165155558 + 115165155559.
It is an arithmetic number, because the mean of its divisors is an integer number (115165155559).
Almost surely, 2230330311117 is an apocalyptic number.
It is an amenable number.
230330311117 is a deficient number, since it is larger than the sum of its proper divisors (1).
230330311117 is an equidigital number, since it uses as much as digits as its factorization.
230330311117 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 25.
Adding to 230330311117 its reverse (711113033032), we get a palindrome (941443344149).
The spelling of 230330311117 in words is "two hundred thirty billion, three hundred thirty million, three hundred eleven thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •