Base | Representation |
---|---|
bin | 1101011001100110011… |
… | …0010011100000100101 |
3 | 211000012202010222101212 |
4 | 3112121212103200211 |
5 | 12232432304101432 |
6 | 253431312001205 |
7 | 22426552413221 |
oct | 3263146234045 |
9 | 730182128355 |
10 | 230210222117 |
11 | 896a473a217 |
12 | 38748b30205 |
13 | 1892a10a255 |
14 | b1dc40d781 |
15 | 5ec57762b2 |
hex | 3599993825 |
230210222117 has 2 divisors, whose sum is σ = 230210222118. Its totient is φ = 230210222116.
The previous prime is 230210222071. The next prime is 230210222119. The reversal of 230210222117 is 711222012032.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 131798767681 + 98411454436 = 363041^2 + 313706^2 .
It is a cyclic number.
It is not a de Polignac number, because 230210222117 - 228 = 229941786661 is a prime.
Together with 230210222119, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 230210222092 and 230210222101.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230210222119) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115105111058 + 115105111059.
It is an arithmetic number, because the mean of its divisors is an integer number (115105111059).
Almost surely, 2230210222117 is an apocalyptic number.
It is an amenable number.
230210222117 is a deficient number, since it is larger than the sum of its proper divisors (1).
230210222117 is an equidigital number, since it uses as much as digits as its factorization.
230210222117 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 230210222117 its reverse (711222012032), we get a palindrome (941432234149).
The spelling of 230210222117 in words is "two hundred thirty billion, two hundred ten million, two hundred twenty-two thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.849 sec. • engine limits •