Base | Representation |
---|---|
bin | 101110011101010001110010… |
… | …011101010011100011100101 |
3 | 222210110000001202202020100101 |
4 | 232131101302131103203211 |
5 | 203240103132222141323 |
6 | 2002320140132344101 |
7 | 61015533136315213 |
oct | 5635216235234345 |
9 | 883400052666311 |
10 | 204322104490213 |
11 | 5a115577355946 |
12 | 1aababab475031 |
13 | 8a01651591708 |
14 | 3865357a85cb3 |
15 | 1894d480c6dad |
hex | b9d4727538e5 |
204322104490213 has 2 divisors, whose sum is σ = 204322104490214. Its totient is φ = 204322104490212.
The previous prime is 204322104490193. The next prime is 204322104490219. The reversal of 204322104490213 is 312094401223402.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 134107123294369 + 70214981195844 = 11580463^2 + 8379438^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-204322104490213 is a prime.
It is a super-2 number, since 2×2043221044902132 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (204322104490219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102161052245106 + 102161052245107.
It is an arithmetic number, because the mean of its divisors is an integer number (102161052245107).
Almost surely, 2204322104490213 is an apocalyptic number.
It is an amenable number.
204322104490213 is a deficient number, since it is larger than the sum of its proper divisors (1).
204322104490213 is an equidigital number, since it uses as much as digits as its factorization.
204322104490213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 82944, while the sum is 37.
The spelling of 204322104490213 in words is "two hundred four trillion, three hundred twenty-two billion, one hundred four million, four hundred ninety thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •