Base | Representation |
---|---|
bin | 101111100100011001… |
… | …101101111011101101 |
3 | 11212211121121110200112 |
4 | 233210121231323231 |
5 | 1314101101242440 |
6 | 35244140305405 |
7 | 3455503554035 |
oct | 574431557355 |
9 | 155747543615 |
10 | 51076587245 |
11 | 1a730446a82 |
12 | 9a95542265 |
13 | 4a7cb13ab8 |
14 | 26876d68c5 |
15 | 14de153965 |
hex | be466deed |
51076587245 has 8 divisors (see below), whose sum is σ = 61363428984. Its totient is φ = 40813586944.
The previous prime is 51076587197. The next prime is 51076587251. The reversal of 51076587245 is 54278567015.
It can be written as a sum of positive squares in 4 ways, for example, as 6446644681 + 44629942564 = 80291^2 + 211258^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 51076587245 - 222 = 51072392941 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 51076587193 and 51076587202.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5955644 + ... + 5964213.
It is an arithmetic number, because the mean of its divisors is an integer number (7670428623).
Almost surely, 251076587245 is an apocalyptic number.
It is an amenable number.
51076587245 is a deficient number, since it is larger than the sum of its proper divisors (10286841739).
51076587245 is a wasteful number, since it uses less digits than its factorization.
51076587245 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11920719.
The product of its (nonzero) digits is 2352000, while the sum is 50.
The spelling of 51076587245 in words is "fifty-one billion, seventy-six million, five hundred eighty-seven thousand, two hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •