Base | Representation |
---|---|
bin | 101110101010001101… |
… | …010001011100001001 |
3 | 11210022120110012200002 |
4 | 232222031101130021 |
5 | 1310101130340111 |
6 | 35003222052345 |
7 | 3422350031651 |
oct | 565215213411 |
9 | 153276405602 |
10 | 50100246281 |
11 | 1a27a312618 |
12 | 986257a0b5 |
13 | 495576b657 |
14 | 25d3b87361 |
15 | 148359763b |
hex | baa351709 |
50100246281 has 2 divisors, whose sum is σ = 50100246282. Its totient is φ = 50100246280.
The previous prime is 50100246277. The next prime is 50100246341. The reversal of 50100246281 is 18264200105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 29923464256 + 20176782025 = 172984^2 + 142045^2 .
It is a cyclic number.
It is not a de Polignac number, because 50100246281 - 22 = 50100246277 is a prime.
It is a super-2 number, since 2×501002462812 (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 (50100245281) 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 as a sum of consecutive naturals, namely, 25050123140 + 25050123141.
It is an arithmetic number, because the mean of its divisors is an integer number (25050123141).
Almost surely, 250100246281 is an apocalyptic number.
It is an amenable number.
50100246281 is a deficient number, since it is larger than the sum of its proper divisors (1).
50100246281 is an equidigital number, since it uses as much as digits as its factorization.
50100246281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3840, while the sum is 29.
Adding to 50100246281 its reverse (18264200105), we get a palindrome (68364446386).
The spelling of 50100246281 in words is "fifty billion, one hundred million, two hundred forty-six thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •