Base | Representation |
---|---|
bin | 101111101111001000… |
… | …000100011000111101 |
3 | 11220022011011111022202 |
4 | 233233020010120331 |
5 | 1314433131310023 |
6 | 35314044521245 |
7 | 3463120101152 |
oct | 575710043075 |
9 | 156264144282 |
10 | 51256510013 |
11 | 1a812a66685 |
12 | 9b25850225 |
13 | 4aab18b787 |
14 | 26a3570229 |
15 | 14eed44128 |
hex | bef20463d |
51256510013 has 8 divisors (see below), whose sum is σ = 52662644160. Its totient is φ = 49868288640.
The previous prime is 51256509989. The next prime is 51256510031. The reversal of 51256510013 is 31001565215.
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 51256510013 - 26 = 51256509949 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (51256510033) 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 7 ways as a sum of consecutive naturals, for example, 4472393 + ... + 4483838.
It is an arithmetic number, because the mean of its divisors is an integer number (6582830520).
Almost surely, 251256510013 is an apocalyptic number.
It is an amenable number.
51256510013 is a deficient number, since it is larger than the sum of its proper divisors (1406134147).
51256510013 is an equidigital number, since it uses as much as digits as its factorization.
51256510013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8956387.
The product of its (nonzero) digits is 4500, while the sum is 29.
The spelling of 51256510013 in words is "fifty-one billion, two hundred fifty-six million, five hundred ten thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •