Base | Representation |
---|---|
bin | 1011111100100101010… |
… | …1000101110011000001 |
3 | 201121202121112211211222 |
4 | 2333021111011303001 |
5 | 11330313222241342 |
6 | 234141515244425 |
7 | 20554032342515 |
oct | 2771125056301 |
9 | 647677484758 |
10 | 205241212097 |
11 | 7a05134a449 |
12 | 3393aa49715 |
13 | 1647b1344cc |
14 | 9d10212145 |
15 | 5513675ed2 |
hex | 2fc9545cc1 |
205241212097 has 2 divisors, whose sum is σ = 205241212098. Its totient is φ = 205241212096.
The previous prime is 205241212019. The next prime is 205241212117. The reversal of 205241212097 is 790212142502.
205241212097 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 can be written as a sum of positive squares in only one way, i.e., 189385113856 + 15856098241 = 435184^2 + 125921^2 .
It is a cyclic number.
It is not a de Polignac number, because 205241212097 - 28 = 205241211841 is a prime.
It is not a weakly prime, because it can be changed into another prime (205241212697) 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, 102620606048 + 102620606049.
It is an arithmetic number, because the mean of its divisors is an integer number (102620606049).
Almost surely, 2205241212097 is an apocalyptic number.
It is an amenable number.
205241212097 is a deficient number, since it is larger than the sum of its proper divisors (1).
205241212097 is an equidigital number, since it uses as much as digits as its factorization.
205241212097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 35.
Adding to 205241212097 its reverse (790212142502), we get a palindrome (995453354599).
The spelling of 205241212097 in words is "two hundred five billion, two hundred forty-one million, two hundred twelve thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •