Base | Representation |
---|---|
bin | 100101010101000100000… |
… | …0101101110010001000001 |
3 | 200011110122120020211201011 |
4 | 1022222020011232101001 |
5 | 1133024202340344100 |
6 | 14524523550240521 |
7 | 1036443634522624 |
oct | 112521005562101 |
9 | 20143576224634 |
10 | 5130474153025 |
11 | 16a89049a98a1 |
12 | 6aa3a14b6141 |
13 | 2b2a56271300 |
14 | 13a45dbd9dbb |
15 | 8d6c6ee4bba |
hex | 4aa8816e441 |
5130474153025 has 27 divisors (see below), whose sum is σ = 6888997661961. Its totient is φ = 3788549113440.
The previous prime is 5130474153019. The next prime is 5130474153043. The reversal of 5130474153025 is 5203514740315.
The square root of 5130474153025 is 2265055.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1322387302401 + 3808086850624 = 1149951^2 + 1951432^2 .
It is not a de Polignac number, because 5130474153025 - 23 = 5130474153017 is a prime.
It is a super-2 number, since 2×51304741530252 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 147211152 + ... + 147245998.
Almost surely, 25130474153025 is an apocalyptic number.
5130474153025 is the 2265055-th square number.
5130474153025 is the 1132528-th centered octagonal number.
It is an amenable number.
5130474153025 is a deficient number, since it is larger than the sum of its proper divisors (1758523508936).
5130474153025 is an frugal number, since it uses more digits than its factorization.
5130474153025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 69730 (or 34865 counting only the distinct ones).
The product of its (nonzero) digits is 252000, while the sum is 40.
The spelling of 5130474153025 in words is "five trillion, one hundred thirty billion, four hundred seventy-four million, one hundred fifty-three thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •