Base | Representation |
---|---|
bin | 101110011101000110101000… |
… | …001001101111000111011001 |
3 | 222210101212010120121210112002 |
4 | 232131012220021233013121 |
5 | 203234404111312143433 |
6 | 2002310435032330345 |
7 | 61014630150421256 |
oct | 5635065011570731 |
9 | 883355116553462 |
10 | 204310120427993 |
11 | 5a11048769a598 |
12 | 1aab8805b439b5 |
13 | 8a0049181a338 |
14 | 386493c21642d |
15 | 1894895e539e8 |
hex | b9d1a826f1d9 |
204310120427993 has 2 divisors, whose sum is σ = 204310120427994. Its totient is φ = 204310120427992.
The previous prime is 204310120427983. The next prime is 204310120428019. The reversal of 204310120427993 is 399724021013402.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123735656064409 + 80574464363584 = 11123653^2 + 8976328^2 .
It is a cyclic number.
It is not a de Polignac number, because 204310120427993 - 24 = 204310120427977 is a prime.
It is a super-2 number, since 2×2043101204279932 (a number of 29 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (204310120427983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102155060213996 + 102155060213997.
It is an arithmetic number, because the mean of its divisors is an integer number (102155060213997).
Almost surely, 2204310120427993 is an apocalyptic number.
It is an amenable number.
204310120427993 is a deficient number, since it is larger than the sum of its proper divisors (1).
204310120427993 is an equidigital number, since it uses as much as digits as its factorization.
204310120427993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 47.
The spelling of 204310120427993 in words is "two hundred four trillion, three hundred ten billion, one hundred twenty million, four hundred twenty-seven thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •