Base | Representation |
---|---|
bin | 101111000010110010… |
… | …110110110010000101 |
3 | 11211101022122122210101 |
4 | 233002302312302011 |
5 | 1311422231023444 |
6 | 35112155324101 |
7 | 3435516206545 |
oct | 570262666205 |
9 | 154338578711 |
10 | 50512751749 |
11 | 1a47114a029 |
12 | 9958750631 |
13 | 49c006b025 |
14 | 2632885325 |
15 | 14a98cb3d4 |
hex | bc2cb6c85 |
50512751749 has 2 divisors, whose sum is σ = 50512751750. Its totient is φ = 50512751748.
The previous prime is 50512751699. The next prime is 50512751761. The reversal of 50512751749 is 94715721505.
50512751749 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 46643040900 + 3869710849 = 215970^2 + 62207^2 .
It is a cyclic number.
It is not a de Polignac number, because 50512751749 - 27 = 50512751621 is a prime.
It is a super-2 number, since 2×505127517492 (a number of 22 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50512751699 and 50512751708.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (50512751449) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25256375874 + 25256375875.
It is an arithmetic number, because the mean of its divisors is an integer number (25256375875).
Almost surely, 250512751749 is an apocalyptic number.
It is an amenable number.
50512751749 is a deficient number, since it is larger than the sum of its proper divisors (1).
50512751749 is an equidigital number, since it uses as much as digits as its factorization.
50512751749 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 441000, while the sum is 46.
The spelling of 50512751749 in words is "fifty billion, five hundred twelve million, seven hundred fifty-one thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •