Base | Representation |
---|---|
bin | 101110100111101000… |
… | …011001010011110001 |
3 | 11210012120010022212202 |
4 | 232213220121103301 |
5 | 1310004044243003 |
6 | 34555035432545 |
7 | 3421313455451 |
oct | 564750312361 |
9 | 153176108782 |
10 | 50057024753 |
11 | 1a25798164a |
12 | 984bbb5755 |
13 | 4949817698 |
14 | 25cc135d61 |
15 | 147e8ab088 |
hex | ba7a194f1 |
50057024753 has 2 divisors, whose sum is σ = 50057024754. Its totient is φ = 50057024752.
The previous prime is 50057024659. The next prime is 50057024761. The reversal of 50057024753 is 35742075005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 48985640929 + 1071383824 = 221327^2 + 32732^2 .
It is a cyclic number.
It is not a de Polignac number, because 50057024753 - 214 = 50057008369 is a prime.
It is a super-2 number, since 2×500570247532 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (50057020753) 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 as a sum of consecutive naturals, namely, 25028512376 + 25028512377.
It is an arithmetic number, because the mean of its divisors is an integer number (25028512377).
Almost surely, 250057024753 is an apocalyptic number.
It is an amenable number.
50057024753 is a deficient number, since it is larger than the sum of its proper divisors (1).
50057024753 is an equidigital number, since it uses as much as digits as its factorization.
50057024753 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 147000, while the sum is 38.
Adding to 50057024753 its reverse (35742075005), we get a palindrome (85799099758).
The spelling of 50057024753 in words is "fifty billion, fifty-seven million, twenty-four thousand, seven hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •