Base | Representation |
---|---|
bin | 101111101100000011… |
… | …111110011010100011 |
3 | 11220011120102212100001 |
4 | 233230003332122203 |
5 | 1314332001332230 |
6 | 35305011040431 |
7 | 3461624133220 |
oct | 575403763243 |
9 | 156146385301 |
10 | 51205105315 |
11 | 1a796a46561 |
12 | 9b105a0117 |
13 | 4aa0630bb0 |
14 | 269a7cc947 |
15 | 14ea58d0ca |
hex | bec0fe6a3 |
51205105315 has 32 divisors (see below), whose sum is σ = 75844177920. Its totient is φ = 32317640064.
The previous prime is 51205105267. The next prime is 51205105361. The reversal of 51205105315 is 51350150215.
It is a cyclic number.
It is not a de Polignac number, because 51205105315 - 29 = 51205104803 is a prime.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4275 + ... + 320044.
It is an arithmetic number, because the mean of its divisors is an integer number (2370130560).
Almost surely, 251205105315 is an apocalyptic number.
51205105315 is a deficient number, since it is larger than the sum of its proper divisors (24639072605).
51205105315 is a wasteful number, since it uses less digits than its factorization.
51205105315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 324691.
The product of its (nonzero) digits is 3750, while the sum is 28.
It can be divided in two parts, 51205 and 105315, that added together give a triangular number (156520 = T559).
The spelling of 51205105315 in words is "fifty-one billion, two hundred five million, one hundred five thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •