Base | Representation |
---|---|
bin | 101111100010011011… |
… | …100010100001010001 |
3 | 11212202022100222201110 |
4 | 233202123202201101 |
5 | 1314014114312403 |
6 | 35240555323533 |
7 | 3454622451663 |
oct | 574233424121 |
9 | 155668328643 |
10 | 51043510353 |
11 | 1a713804900 |
12 | 9a864505a9 |
13 | 4a76002484 |
14 | 2683166533 |
15 | 14db2bd103 |
hex | be26e2851 |
51043510353 has 72 divisors (see below), whose sum is σ = 77094039456. Its totient is φ = 30015265280.
The previous prime is 51043510291. The next prime is 51043510367. The reversal of 51043510353 is 35301534015.
It is not a de Polignac number, because 51043510353 - 26 = 51043510289 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51043510353.
It is not an unprimeable number, because it can be changed into a prime (51043510253) by changing a digit.
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 71 ways as a sum of consecutive naturals, for example, 115222150 + ... + 115222592.
It is an arithmetic number, because the mean of its divisors is an integer number (1070750548).
Almost surely, 251043510353 is an apocalyptic number.
51043510353 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
51043510353 is a deficient number, since it is larger than the sum of its proper divisors (26050529103).
51043510353 is a wasteful number, since it uses less digits than its factorization.
51043510353 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 687 (or 623 counting only the distinct ones).
The product of its (nonzero) digits is 13500, while the sum is 30.
The spelling of 51043510353 in words is "fifty-one billion, forty-three million, five hundred ten thousand, three hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •