Base | Representation |
---|---|
bin | 1011111100101000000… |
… | …0010110100110010111 |
3 | 201121210101220000210112 |
4 | 2333022000112212113 |
5 | 11330324123144421 |
6 | 234143002313235 |
7 | 20554230625634 |
oct | 2771200264627 |
9 | 647711800715 |
10 | 205252553111 |
11 | 7a057796091 |
12 | 339427b881b |
13 | 164805a5578 |
14 | 9d1192518b |
15 | 551466645b |
hex | 2fca016997 |
205252553111 has 2 divisors, whose sum is σ = 205252553112. Its totient is φ = 205252553110.
The previous prime is 205252553089. The next prime is 205252553113. The reversal of 205252553111 is 111355252502.
205252553111 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-205252553111 is a prime.
It is a super-2 number, since 2×2052525531112 (a number of 23 digits) contains 22 as substring.
Together with 205252553113, 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 (205252553113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102626276555 + 102626276556.
It is an arithmetic number, because the mean of its divisors is an integer number (102626276556).
Almost surely, 2205252553111 is an apocalyptic number.
205252553111 is a deficient number, since it is larger than the sum of its proper divisors (1).
205252553111 is an equidigital number, since it uses as much as digits as its factorization.
205252553111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 205252553111 in words is "two hundred five billion, two hundred fifty-two million, five hundred fifty-three thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •