Base | Representation |
---|---|
bin | 11000011101110… |
… | …01000000101001 |
3 | 112022011202210121 |
4 | 30032321000221 |
5 | 410014330441 |
6 | 32210443241 |
7 | 5041266355 |
oct | 1416710051 |
9 | 468152717 |
10 | 205230121 |
11 | a5935478 |
12 | 58893521 |
13 | 33698a55 |
14 | 1d384465 |
15 | 1303ddd1 |
hex | c3b9029 |
205230121 has 2 divisors, whose sum is σ = 205230122. Its totient is φ = 205230120.
The previous prime is 205230119. The next prime is 205230211. The reversal of 205230121 is 121032502.
Together with next prime (205230211) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 166926400 + 38303721 = 12920^2 + 6189^2 .
It is a cyclic number.
It is not a de Polignac number, because 205230121 - 21 = 205230119 is a prime.
Together with 205230119, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 205230095 and 205230104.
It is not a weakly prime, because it can be changed into another prime (205230101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102615060 + 102615061.
It is an arithmetic number, because the mean of its divisors is an integer number (102615061).
Almost surely, 2205230121 is an apocalyptic number.
It is an amenable number.
205230121 is a deficient number, since it is larger than the sum of its proper divisors (1).
205230121 is an equidigital number, since it uses as much as digits as its factorization.
205230121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 120, while the sum is 16.
The square root of 205230121 is about 14325.8549832113. The cubic root of 205230121 is about 589.8574020985.
Adding to 205230121 its reverse (121032502), we get a palindrome (326262623).
The spelling of 205230121 in words is "two hundred five million, two hundred thirty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •