Base | Representation |
---|---|
bin | 10111011011111100001100… |
… | …01100101011001001110100 |
3 | 20202110221110110012001211120 |
4 | 23231332012030223021310 |
5 | 23223342412344213012 |
6 | 301340010255103540 |
7 | 13566315611302362 |
oct | 1355760614531164 |
9 | 222427413161746 |
10 | 51537564054132 |
11 | 1546aa5a366312 |
12 | 59443a9b11bb0 |
13 | 229ac82328a40 |
14 | ca2607b06632 |
15 | 5e5924c1958c |
hex | 2edf8632b274 |
51537564054132 has 48 divisors (see below), whose sum is σ = 129752267171520. Its totient is φ = 15827391318528.
The previous prime is 51537564054083. The next prime is 51537564054139. The reversal of 51537564054132 is 23145046573515.
It is a super-2 number, since 2×515375640541322 (a number of 28 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51537564054139) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 315758757 + ... + 315921932.
It is an arithmetic number, because the mean of its divisors is an integer number (2703172232740).
Almost surely, 251537564054132 is an apocalyptic number.
51537564054132 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
51537564054132 is an abundant number, since it is smaller than the sum of its proper divisors (78214703117388).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51537564054132 is a wasteful number, since it uses less digits than its factorization.
51537564054132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 631681232 (or 631681230 counting only the distinct ones).
The product of its (nonzero) digits is 7560000, while the sum is 51.
The spelling of 51537564054132 in words is "fifty-one trillion, five hundred thirty-seven billion, five hundred sixty-four million, fifty-four thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •