Base | Representation |
---|---|
bin | 100101010010110010000… |
… | …0000001111111000001001 |
3 | 200011000000001022121222202 |
4 | 1022211210000033320021 |
5 | 1132434133341131021 |
6 | 14522353414125545 |
7 | 1036211332126103 |
oct | 112454400177011 |
9 | 20130001277882 |
10 | 5125573770761 |
11 | 16a681a8520a4 |
12 | 6a94543508b5 |
13 | 2b2454c51232 |
14 | 13a11706a573 |
15 | 8d4dbbb9a0b |
hex | 4a96400fe09 |
5125573770761 has 2 divisors, whose sum is σ = 5125573770762. Its totient is φ = 5125573770760.
The previous prime is 5125573770727. The next prime is 5125573770791. The reversal of 5125573770761 is 1670773755215.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4911453792400 + 214119978361 = 2216180^2 + 462731^2 .
It is a cyclic number.
It is not a de Polignac number, because 5125573770761 - 234 = 5108393901577 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5125573770697 and 5125573770706.
It is not a weakly prime, because it can be changed into another prime (5125573770721) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2562786885380 + 2562786885381.
It is an arithmetic number, because the mean of its divisors is an integer number (2562786885381).
Almost surely, 25125573770761 is an apocalyptic number.
It is an amenable number.
5125573770761 is a deficient number, since it is larger than the sum of its proper divisors (1).
5125573770761 is an equidigital number, since it uses as much as digits as its factorization.
5125573770761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10804500, while the sum is 56.
The spelling of 5125573770761 in words is "five trillion, one hundred twenty-five billion, five hundred seventy-three million, seven hundred seventy thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •