Base | Representation |
---|---|
bin | 101111100110000100… |
… | …101011100010100001 |
3 | 11212220120101000210101 |
4 | 233212010223202201 |
5 | 1314130241024344 |
6 | 35251021302401 |
7 | 3456264106123 |
oct | 574604534241 |
9 | 155816330711 |
10 | 51104626849 |
11 | 1a745258601 |
12 | 9aa2a04a01 |
13 | 4a85880693 |
14 | 268b315213 |
15 | 14e18419d4 |
hex | be612b8a1 |
51104626849 has 8 divisors (see below), whose sum is σ = 51421189248. Its totient is φ = 50789040960.
The previous prime is 51104626843. The next prime is 51104626883. The reversal of 51104626849 is 94862640115.
It is a happy number.
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 51104626849 - 25 = 51104626817 is a prime.
It is a super-2 number, since 2×511046268492 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 51104626799 and 51104626808.
It is not an unprimeable number, because it can be changed into a prime (51104626843) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 138997 + ... + 348610.
It is an arithmetic number, because the mean of its divisors is an integer number (6427648656).
Almost surely, 251104626849 is an apocalyptic number.
It is an amenable number.
51104626849 is a deficient number, since it is larger than the sum of its proper divisors (316562399).
51104626849 is a wasteful number, since it uses less digits than its factorization.
51104626849 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 488255.
The product of its (nonzero) digits is 414720, while the sum is 46.
The spelling of 51104626849 in words is "fifty-one billion, one hundred four million, six hundred twenty-six thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •