Base | Representation |
---|---|
bin | 101111101111011001… |
… | …001101101011100000 |
3 | 11220022110121211121200 |
4 | 233233121031223200 |
5 | 1314440304121022 |
6 | 35314325121200 |
7 | 3463203230514 |
oct | 575731155340 |
9 | 156273554550 |
10 | 51261004512 |
11 | 1a815556443 |
12 | 9b27259200 |
13 | 4aac0a3443 |
14 | 26a3dc0144 |
15 | 1500430bac |
hex | bef64dae0 |
51261004512 has 144 divisors (see below), whose sum is σ = 150963740928. Its totient is φ = 16488218880.
The previous prime is 51261004511. The next prime is 51261004559. The reversal of 51261004512 is 21540016215.
51261004512 is a `hidden beast` number, since 5 + 1 + 2 + 610 + 0 + 45 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (144).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51261004511) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1002937 + ... + 1052807.
It is an arithmetic number, because the mean of its divisors is an integer number (1048359312).
Almost surely, 251261004512 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 51261004512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75481870464).
51261004512 is an abundant number, since it is smaller than the sum of its proper divisors (99702736416).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51261004512 is a wasteful number, since it uses less digits than its factorization.
51261004512 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50013 (or 50002 counting only the distinct ones).
The product of its (nonzero) digits is 2400, while the sum is 27.
The spelling of 51261004512 in words is "fifty-one billion, two hundred sixty-one million, four thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •