Base | Representation |
---|---|
bin | 100100011010010001110… |
… | …1101110011100110010001 |
3 | 122201101210211002211012111 |
4 | 1020310203231303212101 |
5 | 1123442133421011400 |
6 | 14350525255025321 |
7 | 1024354431050542 |
oct | 110644355634621 |
9 | 18641724084174 |
10 | 5004236110225 |
11 | 165a314907900 |
12 | 689a3066b241 |
13 | 2a3b888a4171 |
14 | 1342c61dc4c9 |
15 | 8a2895853ba |
hex | 48d23b73991 |
5004236110225 has 81 divisors (see below), whose sum is σ = 6913274788371. Its totient is φ = 3590677516800.
The previous prime is 5004236110213. The next prime is 5004236110243. The reversal of 5004236110225 is 5220116324005.
The square root of 5004236110225 is 2237015.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 13 ways, for example, as 2825199573889 + 2179036536336 = 1680833^2 + 1476156^2 .
It is not a de Polignac number, because 5004236110225 - 221 = 5004234013073 is a prime.
It is a Duffinian number.
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, 10950188197 + ... + 10950188653.
Almost surely, 25004236110225 is an apocalyptic number.
5004236110225 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
5004236110225 is the 2237015-th square number.
5004236110225 is the 1118508-th centered octagonal number.
It is an amenable number.
5004236110225 is a deficient number, since it is larger than the sum of its proper divisors (1909038678146).
5004236110225 is an frugal number, since it uses more digits than its factorization.
5004236110225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1124 (or 562 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 31.
The spelling of 5004236110225 in words is "five trillion, four billion, two hundred thirty-six million, one hundred ten thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •