Base | Representation |
---|---|
bin | 101110101000000110001000… |
… | …010010011001100001111001 |
3 | 222220002001220021200121012022 |
4 | 232220012020102121201321 |
5 | 203334243121004301212 |
6 | 2004045442403524225 |
7 | 61123331154436112 |
oct | 5650061022314171 |
9 | 886061807617168 |
10 | 205065500072057 |
11 | 5a381876820469 |
12 | 1abbb099089675 |
13 | 8a5679441aa21 |
14 | 388d31a4d5209 |
15 | 18a9356ce9772 |
hex | ba8188499879 |
205065500072057 has 2 divisors, whose sum is σ = 205065500072058. Its totient is φ = 205065500072056.
The previous prime is 205065500071987. The next prime is 205065500072071. The reversal of 205065500072057 is 750270005560502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 182673903207481 + 22391596864576 = 13515691^2 + 4731976^2 .
It is a cyclic number.
It is not a de Polignac number, because 205065500072057 - 28 = 205065500071801 is a prime.
It is a super-2 number, since 2×2050655000720572 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 205065500071999 and 205065500072017.
It is not a weakly prime, because it can be changed into another prime (205065500072957) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 102532750036028 + 102532750036029.
It is an arithmetic number, because the mean of its divisors is an integer number (102532750036029).
Almost surely, 2205065500072057 is an apocalyptic number.
It is an amenable number.
205065500072057 is a deficient number, since it is larger than the sum of its proper divisors (1).
205065500072057 is an equidigital number, since it uses as much as digits as its factorization.
205065500072057 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 735000, while the sum is 44.
The spelling of 205065500072057 in words is "two hundred five trillion, sixty-five billion, five hundred million, seventy-two thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •