Base | Representation |
---|---|
bin | 110000010010111111… |
… | …111110100100000000 |
3 | 11221212002200002022202 |
4 | 300102333332210000 |
5 | 1322201220300033 |
6 | 35453504452332 |
7 | 3514045601333 |
oct | 602277764400 |
9 | 157762602282 |
10 | 51858368768 |
11 | 1aaa1774008 |
12 | a07331a0a8 |
13 | 4b75a8840b |
14 | 271d47c61a |
15 | 1537acc8e8 |
hex | c12ffe900 |
51858368768 has 72 divisors (see below), whose sum is σ = 107503918368. Its totient is φ = 24947822592.
The previous prime is 51858368747. The next prime is 51858368813. The reversal of 51858368768 is 86786385815.
It is a super-2 number, since 2×518583687682 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 702380 + ... + 772692.
Almost surely, 251858368768 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 51858368768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53751959184).
51858368768 is an abundant number, since it is smaller than the sum of its proper divisors (55645549600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51858368768 is an equidigital number, since it uses as much as digits as its factorization.
51858368768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 70439 (or 70425 counting only the distinct ones).
The product of its digits is 77414400, while the sum is 65.
It can be divided in two parts, 51858 and 368768, that multiplied together give a square (19123570944 = 1382882).
The spelling of 51858368768 in words is "fifty-one billion, eight hundred fifty-eight million, three hundred sixty-eight thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •