Base | Representation |
---|---|
bin | 110000001100100000… |
… | …011001000001001001 |
3 | 11221120111200011212201 |
4 | 300030200121001021 |
5 | 1321440323101400 |
6 | 35435013440201 |
7 | 3511253566561 |
oct | 601440310111 |
9 | 157514604781 |
10 | 51749425225 |
11 | 1aa46224123 |
12 | a042940061 |
13 | 4b59332b94 |
14 | 270cbddda1 |
15 | 152d25d06a |
hex | c0c819049 |
51749425225 has 9 divisors (see below), whose sum is σ = 64170697717. Its totient is φ = 41398630240.
The previous prime is 51749425177. The next prime is 51749425243. The reversal of 51749425225 is 52252494715.
The square root of 51749425225 is 227485.
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 12178667449 + 39570757776 = 110357^2 + 198924^2 .
It is not a de Polignac number, because 51749425225 - 27 = 51749425097 is a prime.
It is a super-2 number, since 2×517494252252 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 1114677 + ... + 1160173.
Almost surely, 251749425225 is an apocalyptic number.
51749425225 is the 227485-th square number.
51749425225 is the 113743-rd centered octagonal number.
It is an amenable number.
51749425225 is a deficient number, since it is larger than the sum of its proper divisors (12421272492).
51749425225 is an frugal number, since it uses more digits than its factorization.
51749425225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91004 (or 45502 counting only the distinct ones).
The product of its digits is 1008000, while the sum is 46.
The spelling of 51749425225 in words is "fifty-one billion, seven hundred forty-nine million, four hundred twenty-five thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •