Base | Representation |
---|---|
bin | 1001011010000100… |
… | …01001101101000101 |
3 | 111000222102021211202 |
4 | 10231002021231011 |
5 | 40320412143203 |
6 | 2153053512245 |
7 | 236104410305 |
oct | 45502115505 |
9 | 14028367752 |
10 | 5050506053 |
11 | 2161973a4a |
12 | b8b4a2685 |
13 | 626463428 |
14 | 35ca8b605 |
15 | 1e85d1388 |
hex | 12d089b45 |
5050506053 has 2 divisors, whose sum is σ = 5050506054. Its totient is φ = 5050506052.
The previous prime is 5050505989. The next prime is 5050506059. The reversal of 5050506053 is 3506050505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5038444324 + 12061729 = 70982^2 + 3473^2 .
It is a cyclic number.
It is not a de Polignac number, because 5050506053 - 26 = 5050505989 is a prime.
It is a super-2 number, since 2×50505060532 = 51015222782779277618, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5050506059) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525253026 + 2525253027.
It is an arithmetic number, because the mean of its divisors is an integer number (2525253027).
Almost surely, 25050506053 is an apocalyptic number.
It is an amenable number.
5050506053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050506053 is an equidigital number, since it uses as much as digits as its factorization.
5050506053 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 11250, while the sum is 29.
The square root of 5050506053 is about 71066.9125050470. The cubic root of 5050506053 is about 1715.7142775199.
Adding to 5050506053 its reverse (3506050505), we get a palindrome (8556556558).
The spelling of 5050506053 in words is "five billion, fifty million, five hundred six thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •