Base | Representation |
---|---|
bin | 11000100000000… |
… | …11001101001111 |
3 | 112022202012200112 |
4 | 30100003031033 |
5 | 410104042111 |
6 | 32221150235 |
7 | 5044003403 |
oct | 1420031517 |
9 | 468665615 |
10 | 205534031 |
11 | a602283a |
12 | 589bb37b |
13 | 33774191 |
14 | 1d423103 |
15 | 1309de8b |
hex | c40334f |
205534031 has 2 divisors, whose sum is σ = 205534032. Its totient is φ = 205534030.
The previous prime is 205534013. The next prime is 205534033. The reversal of 205534031 is 130435502.
Together with previous prime (205534013) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-205534031 is a prime.
It is a super-2 number, since 2×2055340312 = 84488475798217922, which contains 22 as substring.
Together with 205534033, 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 = 205533988 and 205534006.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (205534033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102767015 + 102767016.
It is an arithmetic number, because the mean of its divisors is an integer number (102767016).
Almost surely, 2205534031 is an apocalyptic number.
205534031 is a deficient number, since it is larger than the sum of its proper divisors (1).
205534031 is an equidigital number, since it uses as much as digits as its factorization.
205534031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1800, while the sum is 23.
The square root of 205534031 is about 14336.4581051248. The cubic root of 205534031 is about 590.1484171290.
Adding to 205534031 its reverse (130435502), we get a palindrome (335969533).
The spelling of 205534031 in words is "two hundred five million, five hundred thirty-four thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •