Base | Representation |
---|---|
bin | 100101010010110001111… |
… | …1100001011110010110101 |
3 | 200010222222222022111200012 |
4 | 1022211203330023302311 |
5 | 1132434133103033321 |
6 | 14522353335230005 |
7 | 1036211320101215 |
oct | 112454374136265 |
9 | 20128888274605 |
10 | 5125572705461 |
11 | 16a681a19478a |
12 | 6a9453b18305 |
13 | 2b245496a390 |
14 | 13a116c70245 |
15 | 8d4dba5905b |
hex | 4a963f0bcb5 |
5125572705461 has 8 divisors (see below), whose sum is σ = 5519920553784. Its totient is φ = 4731235289280.
The previous prime is 5125572705389. The next prime is 5125572705493. The reversal of 5125572705461 is 1645072755215.
It can be written as a sum of positive squares in 4 ways, for example, as 662768579236 + 4462804126225 = 814106^2 + 2112535^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5125572705461 - 218 = 5125572443317 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5125572765461) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1572350 + ... + 3566991.
It is an arithmetic number, because the mean of its divisors is an integer number (689990069223).
Almost surely, 25125572705461 is an apocalyptic number.
It is an amenable number.
5125572705461 is a deficient number, since it is larger than the sum of its proper divisors (394347848323).
5125572705461 is a wasteful number, since it uses less digits than its factorization.
5125572705461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5216071.
The product of its (nonzero) digits is 2940000, while the sum is 50.
The spelling of 5125572705461 in words is "five trillion, one hundred twenty-five billion, five hundred seventy-two million, seven hundred five thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •