Base | Representation |
---|---|
bin | 110000000101011011… |
… | …010011110001110111 |
3 | 11221021020011220101012 |
4 | 300011123103301313 |
5 | 1321214421340120 |
6 | 35415132022435 |
7 | 3505312206530 |
oct | 600533236167 |
9 | 157236156335 |
10 | 51630652535 |
11 | 1a995180480 |
12 | a00b001a1b |
13 | 4b3a848797 |
14 | 26db123687 |
15 | 1522aeb1c5 |
hex | c056d3c77 |
51630652535 has 64 divisors (see below), whose sum is σ = 81428889600. Its totient is φ = 30446928000.
The previous prime is 51630652531. The next prime is 51630652547. The reversal of 51630652535 is 53525603615.
It is not a de Polignac number, because 51630652535 - 22 = 51630652531 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 51630652492 and 51630652501.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51630652531) 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 63 ways as a sum of consecutive naturals, for example, 5401010 + ... + 5410560.
It is an arithmetic number, because the mean of its divisors is an integer number (1272326400).
Almost surely, 251630652535 is an apocalyptic number.
51630652535 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
51630652535 is a deficient number, since it is larger than the sum of its proper divisors (29798237065).
51630652535 is a wasteful number, since it uses less digits than its factorization.
51630652535 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10332.
The product of its (nonzero) digits is 405000, while the sum is 41.
The spelling of 51630652535 in words is "fifty-one billion, six hundred thirty million, six hundred fifty-two thousand, five hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •