Base | Representation |
---|---|
bin | 110000010011101000… |
… | …000001111110010100 |
3 | 11221212211102112020201 |
4 | 300103220001332110 |
5 | 1322211412243000 |
6 | 35454521510244 |
7 | 3514234051651 |
oct | 602350017624 |
9 | 157784375221 |
10 | 51868868500 |
11 | 1aaa7695679 |
12 | a076942384 |
13 | 4b77cc3587 |
14 | 2720a12c28 |
15 | 15389a396a |
hex | c13a01f94 |
51868868500 has 24 divisors (see below), whose sum is σ = 113281609896. Its totient is φ = 20747547200.
The previous prime is 51868868479. The next prime is 51868868503. The reversal of 51868868500 is 586886815.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 6160994064 + 45707874436 = 78492^2 + 213794^2 .
It is a super-3 number, since 3×518688685003 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51868868503) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 51868369 + ... + 51869368.
It is an arithmetic number, because the mean of its divisors is an integer number (4720067079).
Almost surely, 251868868500 is an apocalyptic number.
51868868500 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
51868868500 is an abundant number, since it is smaller than the sum of its proper divisors (61412741396).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51868868500 is a wasteful number, since it uses less digits than its factorization.
51868868500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 103737756 (or 103737744 counting only the distinct ones).
The product of its (nonzero) digits is 3686400, while the sum is 55.
The spelling of 51868868500 in words is "fifty-one billion, eight hundred sixty-eight million, eight hundred sixty-eight thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •