Base | Representation |
---|---|
bin | 101111100010110100… |
… | …101110000001010100 |
3 | 11212202202210100012002 |
4 | 233202310232001110 |
5 | 1314022312023220 |
6 | 35241353014432 |
7 | 3455032533014 |
oct | 574264560124 |
9 | 155682710162 |
10 | 51050111060 |
11 | 1a717503033 |
12 | 9a886b4418 |
13 | 4a774a3a10 |
14 | 2683da3c44 |
15 | 14dbb73c75 |
hex | be2d2e054 |
51050111060 has 48 divisors (see below), whose sum is σ = 118267711632. Its totient is φ = 18389529600.
The previous prime is 51050111011. The next prime is 51050111113. The reversal of 51050111060 is 6011105015.
It can be written as a sum of positive squares in 8 ways, for example, as 12072295876 + 38977815184 = 109874^2 + 197428^2 .
It is a super-2 number, since 2×510501110602 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 2383811 + ... + 2405130.
It is an arithmetic number, because the mean of its divisors is an integer number (2463910659).
Almost surely, 251050111060 is an apocalyptic number.
It is an amenable number.
51050111060 is an abundant number, since it is smaller than the sum of its proper divisors (67217600572).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51050111060 is a wasteful number, since it uses less digits than its factorization.
51050111060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4789004 (or 4789002 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 51050111060 its reverse (6011105015), we get a palindrome (57061216075).
The spelling of 51050111060 in words is "fifty-one billion, fifty million, one hundred eleven thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •