Base | Representation |
---|---|
bin | 101110101010010110101000… |
… | …101111010101111110100101 |
3 | 222220121220101212202222022202 |
4 | 232222112220233111332211 |
5 | 203344313404304301003 |
6 | 2004245023215304245 |
7 | 61140463230531242 |
oct | 5652265057257645 |
9 | 886556355688282 |
10 | 205220663353253 |
11 | 5a43165a40a159 |
12 | 1b025180b1b085 |
13 | 8a682c15c7b52 |
14 | 3896a398cc5c9 |
15 | 18ad3d8d35088 |
hex | baa5a8bd5fa5 |
205220663353253 has 2 divisors, whose sum is σ = 205220663353254. Its totient is φ = 205220663353252.
The previous prime is 205220663353229. The next prime is 205220663353301. The reversal of 205220663353253 is 352353366022502.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 126592044223969 + 78628619129284 = 11251313^2 + 8867278^2 .
It is a cyclic number.
It is not a de Polignac number, because 205220663353253 - 28 = 205220663352997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 205220663353198 and 205220663353207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (205220663359253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102610331676626 + 102610331676627.
It is an arithmetic number, because the mean of its divisors is an integer number (102610331676627).
Almost surely, 2205220663353253 is an apocalyptic number.
It is an amenable number.
205220663353253 is a deficient number, since it is larger than the sum of its proper divisors (1).
205220663353253 is an equidigital number, since it uses as much as digits as its factorization.
205220663353253 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5832000, while the sum is 47.
The spelling of 205220663353253 in words is "two hundred five trillion, two hundred twenty billion, six hundred sixty-three million, three hundred fifty-three thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •