Base | Representation |
---|---|
bin | 101111110110000010… |
… | …011111100101000001 |
3 | 11220121020101211121201 |
4 | 233312002133211001 |
5 | 1320202324122100 |
6 | 35333350421201 |
7 | 3466025644324 |
oct | 576602374501 |
9 | 156536354551 |
10 | 51372489025 |
11 | 1a872481400 |
12 | 9b58661801 |
13 | 4ac9208400 |
14 | 26b4b207bb |
15 | 150a10336a |
hex | bf609f941 |
51372489025 has 81 divisors (see below), whose sum is σ = 76059788763. Its totient is φ = 34379030400.
The previous prime is 51372488963. The next prime is 51372489037. The reversal of 51372489025 is 52098427315.
The square root of 51372489025 is 226655.
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 47068604209 + 4303884816 = 216953^2 + 65604^2 .
It is not a de Polignac number, because 51372489025 - 213 = 51372480833 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 162058167 + ... + 162058483.
Almost surely, 251372489025 is an apocalyptic number.
51372489025 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51372489025 is the 226655-th square number.
51372489025 is the 113328-th centered octagonal number.
It is an amenable number.
51372489025 is a deficient number, since it is larger than the sum of its proper divisors (24687299738).
51372489025 is a wasteful number, since it uses less digits than its factorization.
51372489025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 692 (or 346 counting only the distinct ones).
The product of its (nonzero) digits is 604800, while the sum is 46.
The spelling of 51372489025 in words is "fifty-one billion, three hundred seventy-two million, four hundred eighty-nine thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •