Base | Representation |
---|---|
bin | 101111101000110100… |
… | …001111110010000110 |
3 | 11220000202222021101010 |
4 | 233220310033302012 |
5 | 1314224031304002 |
6 | 35255343543050 |
7 | 3460363232640 |
oct | 575064176206 |
9 | 156022867333 |
10 | 51150650502 |
11 | 1a769232886 |
12 | 9ab62baa86 |
13 | 4a92275c03 |
14 | 2693495890 |
15 | 14e58d346c |
hex | be8d0fc86 |
51150650502 has 32 divisors (see below), whose sum is σ = 118897401600. Its totient is φ = 14366767968.
The previous prime is 51150650497. The next prime is 51150650503. The reversal of 51150650502 is 20505605115.
It is a self number, because there is not a number n which added to its sum of digits gives 51150650502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51150650503) 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 in 15 ways as a sum of consecutive naturals, for example, 10318477 + ... + 10323432.
It is an arithmetic number, because the mean of its divisors is an integer number (3715543800).
Almost surely, 251150650502 is an apocalyptic number.
51150650502 is an abundant number, since it is smaller than the sum of its proper divisors (67746751098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
51150650502 is a wasteful number, since it uses less digits than its factorization.
51150650502 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20641980.
The product of its (nonzero) digits is 7500, while the sum is 30.
The spelling of 51150650502 in words is "fifty-one billion, one hundred fifty million, six hundred fifty thousand, five hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •