Base | Representation |
---|---|
bin | 10000011100011111001… |
… | …11100000111001110101 |
3 | 2000000111022200002000202 |
4 | 20032033213200321311 |
5 | 33224210323403203 |
6 | 1111325215050245 |
7 | 55552320406121 |
oct | 10161747407165 |
9 | 2000438602022 |
10 | 565050216053 |
11 | 1a8700130634 |
12 | 91616210985 |
13 | 4138cc6938b |
14 | 1d4c46ca581 |
15 | ea7190b388 |
hex | 838f9e0e75 |
565050216053 has 2 divisors, whose sum is σ = 565050216054. Its totient is φ = 565050216052.
The previous prime is 565050216041. The next prime is 565050216091. The reversal of 565050216053 is 350612050565.
It is an a-pointer prime, because the next prime (565050216091) can be obtained adding 565050216053 to its sum of digits (38).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 288366852004 + 276683364049 = 536998^2 + 526007^2 .
It is a cyclic number.
It is not a de Polignac number, because 565050216053 - 214 = 565050199669 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 565050215998 and 565050216016.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (565050216253) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 282525108026 + 282525108027.
It is an arithmetic number, because the mean of its divisors is an integer number (282525108027).
Almost surely, 2565050216053 is an apocalyptic number.
It is an amenable number.
565050216053 is a deficient number, since it is larger than the sum of its proper divisors (1).
565050216053 is an equidigital number, since it uses as much as digits as its factorization.
565050216053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 135000, while the sum is 38.
The spelling of 565050216053 in words is "five hundred sixty-five billion, fifty million, two hundred sixteen thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •