Base | Representation |
---|---|
bin | 101111100011001011… |
… | …011000000110110101 |
3 | 11212210011222002201112 |
4 | 233203023120012311 |
5 | 1314030322104423 |
6 | 35242124204405 |
7 | 3455134161341 |
oct | 574313300665 |
9 | 155704862645 |
10 | 51056050613 |
11 | 1a71a89a557 |
12 | 9a8a699705 |
13 | 4a787a3349 |
14 | 2684aac621 |
15 | 14dc448a78 |
hex | be32d81b5 |
51056050613 has 2 divisors, whose sum is σ = 51056050614. Its totient is φ = 51056050612.
The previous prime is 51056050579. The next prime is 51056050631. The reversal of 51056050613 is 31605065015.
Together with next prime (51056050631) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 43423057924 + 7632992689 = 208382^2 + 87367^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-51056050613 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51056050613.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (51056050313) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25528025306 + 25528025307.
It is an arithmetic number, because the mean of its divisors is an integer number (25528025307).
Almost surely, 251056050613 is an apocalyptic number.
It is an amenable number.
51056050613 is a deficient number, since it is larger than the sum of its proper divisors (1).
51056050613 is an equidigital number, since it uses as much as digits as its factorization.
51056050613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13500, while the sum is 32.
The spelling of 51056050613 in words is "fifty-one billion, fifty-six million, fifty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •