Base | Representation |
---|---|
bin | 100110011001101010100… |
… | …0010100001110000000001 |
3 | 200200112220112121222001121 |
4 | 1030303111002201300001 |
5 | 1142432410234032100 |
6 | 15120330215032241 |
7 | 1053210441134611 |
oct | 114632502416001 |
9 | 20615815558047 |
10 | 5277794049025 |
11 | 1755333170163 |
12 | 712a5666b681 |
13 | 2c39034b1cc4 |
14 | 143637656a41 |
15 | 9244a66e51a |
hex | 4ccd50a1c01 |
5277794049025 has 9 divisors (see below), whose sum is σ = 6544478864361. Its totient is φ = 4222226049840.
The previous prime is 5277794048993. The next prime is 5277794049131. The reversal of 5277794049025 is 5209404977725.
The square root of 5277794049025 is 2297345.
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 1041508014849 + 4236286034176 = 1020543^2 + 2058224^2 .
It is not a de Polignac number, because 5277794049025 - 25 = 5277794048993 is a prime.
It is a super-2 number, since 2×52777940490252 (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 8 ways as a sum of consecutive naturals, for example, 11256991 + ... + 11716459.
Almost surely, 25277794049025 is an apocalyptic number.
5277794049025 is the 2297345-th square number.
5277794049025 is the 1148673-rd centered octagonal number.
It is an amenable number.
5277794049025 is a deficient number, since it is larger than the sum of its proper divisors (1266684815336).
5277794049025 is an frugal number, since it uses more digits than its factorization.
5277794049025 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 918948 (or 459474 counting only the distinct ones).
The product of its (nonzero) digits is 44452800, while the sum is 61.
The spelling of 5277794049025 in words is "five trillion, two hundred seventy-seven billion, seven hundred ninety-four million, forty-nine thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •