Base | Representation |
---|---|
bin | 1011111000111100111… |
… | …0111100011011010001 |
3 | 201112020200111110211122 |
4 | 2332033032330123101 |
5 | 11321314212203241 |
6 | 233501100252025 |
7 | 20520625535411 |
oct | 2761716743321 |
9 | 645220443748 |
10 | 204266522321 |
11 | 796a1143604 |
12 | 33708541015 |
13 | 163542197b4 |
14 | 9c5a9b2641 |
15 | 54a7ce404b |
hex | 2f8f3bc6d1 |
204266522321 has 2 divisors, whose sum is σ = 204266522322. Its totient is φ = 204266522320.
The previous prime is 204266522279. The next prime is 204266522323. The reversal of 204266522321 is 123225662402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 188585221696 + 15681300625 = 434264^2 + 125225^2 .
It is a cyclic number.
It is not a de Polignac number, because 204266522321 - 210 = 204266521297 is a prime.
It is a super-2 number, since 2×2042665223212 (a number of 23 digits) contains 22 as substring.
Together with 204266522323, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (204266522323) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102133261160 + 102133261161.
It is an arithmetic number, because the mean of its divisors is an integer number (102133261161).
Almost surely, 2204266522321 is an apocalyptic number.
It is an amenable number.
204266522321 is a deficient number, since it is larger than the sum of its proper divisors (1).
204266522321 is an equidigital number, since it uses as much as digits as its factorization.
204266522321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 69120, while the sum is 35.
The spelling of 204266522321 in words is "two hundred four billion, two hundred sixty-six million, five hundred twenty-two thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •