Base | Representation |
---|---|
bin | 100101101110010100010… |
… | …0100101011011100001001 |
3 | 200100122122002110210120121 |
4 | 1023130220210223130021 |
5 | 1134421234243330100 |
6 | 15005453212023241 |
7 | 1043403565545400 |
oct | 113345044533411 |
9 | 20318562423517 |
10 | 5184706230025 |
11 | 1719904557a43 |
12 | 6b89b7761b21 |
13 | 2b7bb9a3b1ba |
14 | 13cd26612637 |
15 | 8eced1a351a |
hex | 4b72892b709 |
5184706230025 has 81 divisors (see below), whose sum is σ = 7599788971047. Its totient is φ = 3498557277600.
The previous prime is 5184706229993. The next prime is 5184706230071. The reversal of 5184706230025 is 5200326074815.
The square root of 5184706230025 is 2276995.
It is a perfect power (a square), and thus also a powerful number.
5184706230025 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in only one way, i.e., 1866494242809 + 3318211987216 = 1366197^2 + 1821596^2 .
It is not a de Polignac number, because 5184706230025 - 25 = 5184706229993 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 5339552790 + ... + 5339553760.
Almost surely, 25184706230025 is an apocalyptic number.
5184706230025 is the 2276995-th square number.
5184706230025 is the 1138498-th centered octagonal number.
It is an amenable number.
5184706230025 is a deficient number, since it is larger than the sum of its proper divisors (2415082741022).
5184706230025 is an frugal number, since it uses more digits than its factorization.
5184706230025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2100 (or 1050 counting only the distinct ones).
The product of its (nonzero) digits is 403200, while the sum is 43.
The spelling of 5184706230025 in words is "five trillion, one hundred eighty-four billion, seven hundred six million, two hundred thirty thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •