Base | Representation |
---|---|
bin | 110000000101011001… |
… | …110100000100100001 |
3 | 11221021012102222121212 |
4 | 300011121310010201 |
5 | 1321214321314023 |
6 | 35415115355505 |
7 | 3505305654566 |
oct | 600531640441 |
9 | 157235388555 |
10 | 51630260513 |
11 | 1a994a32997 |
12 | a00aa52b95 |
13 | 4b3a73c210 |
14 | 26db06086d |
15 | 1522a6ee78 |
hex | c05674121 |
51630260513 has 4 divisors (see below), whose sum is σ = 55601819028. Its totient is φ = 47658702000.
The previous prime is 51630260503. The next prime is 51630260531. The reversal of 51630260513 is 31506203615.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 3451327504 + 48178933009 = 58748^2 + 219497^2 .
It is a de Polignac number, because none of the positive numbers 2k-51630260513 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 51630260513.
It is not an unprimeable number, because it can be changed into a prime (51630260503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1985779238 + ... + 1985779263.
It is an arithmetic number, because the mean of its divisors is an integer number (13900454757).
Almost surely, 251630260513 is an apocalyptic number.
It is an amenable number.
51630260513 is a deficient number, since it is larger than the sum of its proper divisors (3971558515).
51630260513 is a wasteful number, since it uses less digits than its factorization.
51630260513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3971558514.
The product of its (nonzero) digits is 16200, while the sum is 32.
The spelling of 51630260513 in words is "fifty-one billion, six hundred thirty million, two hundred sixty thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •