Base | Representation |
---|---|
bin | 1001011010000001… |
… | …01110111100001001 |
3 | 111000221201101212102 |
4 | 10231000232330021 |
5 | 40320313244111 |
6 | 2153041523145 |
7 | 236101301363 |
oct | 45500567411 |
9 | 14027641772 |
10 | 5050134281 |
11 | 216173a6a5 |
12 | b8b3434b5 |
13 | 62636314a |
14 | 35c9d1d33 |
15 | 1e855b13b |
hex | 12d02ef09 |
5050134281 has 2 divisors, whose sum is σ = 5050134282. Its totient is φ = 5050134280.
The previous prime is 5050134227. The next prime is 5050134283. The reversal of 5050134281 is 1824310505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4327008400 + 723125881 = 65780^2 + 26891^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050134281 - 218 = 5049872137 is a prime.
It is a super-2 number, since 2×50501342812 = 51007712512262773922, which contains 22 as substring.
Together with 5050134283, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (5050134283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525067140 + 2525067141.
It is an arithmetic number, because the mean of its divisors is an integer number (2525067141).
Almost surely, 25050134281 is an apocalyptic number.
It is an amenable number.
5050134281 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050134281 is an equidigital number, since it uses as much as digits as its factorization.
5050134281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4800, while the sum is 29.
The square root of 5050134281 is about 71064.2968092980. The cubic root of 5050134281 is about 1715.6721780964.
Adding to 5050134281 its reverse (1824310505), we get a palindrome (6874444786).
The spelling of 5050134281 in words is "five billion, fifty million, one hundred thirty-four thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •