Base | Representation |
---|---|
bin | 101001111010101110101… |
… | …1000000000000000011101 |
3 | 202101202110012101012201002 |
4 | 1103311131120000000131 |
5 | 1223342232113412014 |
6 | 20130342042400045 |
7 | 1133140603415111 |
oct | 123653530000035 |
9 | 22352405335632 |
10 | 5761117716509 |
11 | 1921304839171 |
12 | 790662800025 |
13 | 32a36a702cac |
14 | 15cba7b71741 |
15 | 9ecd7211dde |
hex | 53d5d60001d |
5761117716509 has 2 divisors, whose sum is σ = 5761117716510. Its totient is φ = 5761117716508.
The previous prime is 5761117716427. The next prime is 5761117716511. The reversal of 5761117716509 is 9056177111675.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5131629396100 + 629488320409 = 2265310^2 + 793403^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5761117716509 is a prime.
It is a super-2 number, since 2×57611177165092 (a number of 26 digits) contains 22 as substring.
Together with 5761117716511, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5761117716539) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2880558858254 + 2880558858255.
It is an arithmetic number, because the mean of its divisors is an integer number (2880558858255).
Almost surely, 25761117716509 is an apocalyptic number.
It is an amenable number.
5761117716509 is a deficient number, since it is larger than the sum of its proper divisors (1).
5761117716509 is an equidigital number, since it uses as much as digits as its factorization.
5761117716509 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2778300, while the sum is 56.
The spelling of 5761117716509 in words is "five trillion, seven hundred sixty-one billion, one hundred seventeen million, seven hundred sixteen thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.129 sec. • engine limits •