Base | Representation |
---|---|
bin | 101111110010101100… |
… | …110000111100000011 |
3 | 11220110022222100001100 |
4 | 233302230300330003 |
5 | 1320044003230230 |
6 | 35324025505443 |
7 | 3464445503250 |
oct | 576254607403 |
9 | 156408870040 |
10 | 51316461315 |
11 | 1a843893a09 |
12 | 9b41942283 |
13 | 4aba71c512 |
14 | 26ab4d8427 |
15 | 1505237660 |
hex | bf2b30f03 |
51316461315 has 48 divisors (see below), whose sum is σ = 107005766400. Its totient is φ = 22224269376.
The previous prime is 51316461299. The next prime is 51316461323.
51316461315 is a `hidden beast` number, since 5 + 1 + 3 + 1 + 646 + 1 + 3 + 1 + 5 = 666.
51316461315 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 51316461315 - 24 = 51316461299 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 51316461315.
It is an unprimeable number.
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 in 47 ways as a sum of consecutive naturals, for example, 4281105 + ... + 4293074.
It is an arithmetic number, because the mean of its divisors is an integer number (2229286800).
Almost surely, 251316461315 is an apocalyptic number.
51316461315 is an abundant number, since it is smaller than the sum of its proper divisors (55689305085).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51316461315 is a wasteful number, since it uses less digits than its factorization.
51316461315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8574216 (or 8574213 counting only the distinct ones).
The product of its digits is 32400, while the sum is 36.
The spelling of 51316461315 in words is "fifty-one billion, three hundred sixteen million, four hundred sixty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •