Base | Representation |
---|---|
bin | 10111100111011001101001… |
… | …10110001011111000010000 |
3 | 20210212120212002221110000021 |
4 | 23303230310312023320100 |
5 | 23301320334031224400 |
6 | 302240532042433224 |
7 | 13636625631261421 |
oct | 1363546466137020 |
9 | 223776762843007 |
10 | 51931336195600 |
11 | 15601a57487394 |
12 | 59a8783502814 |
13 | 22c914760b994 |
14 | cb76c0b05648 |
15 | 600cbe9bb71a |
hex | 2f3b34d8be10 |
51931336195600 has 45 divisors (see below), whose sum is σ = 124765381475527. Its totient is φ = 20772476827520.
The previous prime is 51931336195597. The next prime is 51931336195639. The reversal of 51931336195600 is 659163313915.
The square root of 51931336195600 is 7206340.
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 14880059371024 + 37051276824576 = 3857468^2 + 6086976^2 .
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, 143946642 + ... + 144306958.
Almost surely, 251931336195600 is an apocalyptic number.
51931336195600 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
51931336195600 is the 7206340-th square number.
It is an amenable number.
51931336195600 is an abundant number, since it is smaller than the sum of its proper divisors (72834045279927).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51931336195600 is an frugal number, since it uses more digits than its factorization.
51931336195600 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 720652 (or 360324 counting only the distinct ones).
The product of its (nonzero) digits is 1968300, while the sum is 52.
The spelling of 51931336195600 in words is "fifty-one trillion, nine hundred thirty-one billion, three hundred thirty-six million, one hundred ninety-five thousand, six hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •