Base | Representation |
---|---|
bin | 101111100010110100… |
… | …010101011110111000 |
3 | 11212202202121020022120 |
4 | 233202310111132320 |
5 | 1314022300314202 |
6 | 35241350521240 |
7 | 3455031634002 |
oct | 574264253670 |
9 | 155682536276 |
10 | 51050010552 |
11 | 1a717444572 |
12 | 9a88666220 |
13 | 4a7746a048 |
14 | 2683d79372 |
15 | 14dbb540bc |
hex | be2d157b8 |
51050010552 has 64 divisors (see below), whose sum is σ = 130023463680. Its totient is φ = 16698815232.
The previous prime is 51050010551. The next prime is 51050010553. The reversal of 51050010552 is 25501005015.
It is an interprime number because it is at equal distance from previous prime (51050010551) and next prime (51050010553).
It is a super-2 number, since 2×510500105522 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51050010551) 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, 362548 + ... + 483260.
It is an arithmetic number, because the mean of its divisors is an integer number (2031616620).
Almost surely, 251050010552 is an apocalyptic number.
It is an amenable number.
51050010552 is an abundant number, since it is smaller than the sum of its proper divisors (78973453128).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51050010552 is a wasteful number, since it uses less digits than its factorization.
51050010552 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 121052 (or 121048 counting only the distinct ones).
The product of its (nonzero) digits is 1250, while the sum is 24.
Adding to 51050010552 its reverse (25501005015), we get a palindrome (76551015567).
The spelling of 51050010552 in words is "fifty-one billion, fifty million, ten thousand, five hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •