Base | Representation |
---|---|
bin | 101001111100110100101… |
… | …0110101011111100000101 |
3 | 202102012001112022010000212 |
4 | 1103321221112223330011 |
5 | 1223430434044303203 |
6 | 20132404130245205 |
7 | 1133360165355533 |
oct | 123715126537405 |
9 | 22365045263025 |
10 | 5765613666053 |
11 | 192320167264a |
12 | 7914b8426805 |
13 | 32a905cbbc77 |
14 | 15d0b2d05153 |
15 | 9ee9bca01d8 |
hex | 53e695abf05 |
5765613666053 has 2 divisors, whose sum is σ = 5765613666054. Its totient is φ = 5765613666052.
The previous prime is 5765613666049. The next prime is 5765613666061. The reversal of 5765613666053 is 3506663165675.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5761838546689 + 3775119364 = 2400383^2 + 61442^2 .
It is a cyclic number.
It is not a de Polignac number, because 5765613666053 - 22 = 5765613666049 is a prime.
It is a super-2 number, since 2×57656136660532 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5765613665983 and 5765613666001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5765613696053) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2882806833026 + 2882806833027.
It is an arithmetic number, because the mean of its divisors is an integer number (2882806833027).
Almost surely, 25765613666053 is an apocalyptic number.
It is an amenable number.
5765613666053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5765613666053 is an equidigital number, since it uses as much as digits as its factorization.
5765613666053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 61236000, while the sum is 59.
The spelling of 5765613666053 in words is "five trillion, seven hundred sixty-five billion, six hundred thirteen million, six hundred sixty-six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •