Base | Representation |
---|---|
bin | 1001010101010001… |
… | …01000110000001101 |
3 | 110221011200201211021 |
4 | 10222220220300031 |
5 | 40230111404203 |
6 | 2145055154141 |
7 | 235105350625 |
oct | 45250506015 |
9 | 13834621737 |
10 | 5010263053 |
11 | 2141187874 |
12 | b79b15951 |
13 | 61b0130c3 |
14 | 3575b3885 |
15 | 1e4cd25bd |
hex | 12aa28c0d |
5010263053 has 2 divisors, whose sum is σ = 5010263054. Its totient is φ = 5010263052.
The previous prime is 5010263051. The next prime is 5010263087. The reversal of 5010263053 is 3503620105.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4645376649 + 364886404 = 68157^2 + 19102^2 .
It is a cyclic number.
It is not a de Polignac number, because 5010263053 - 21 = 5010263051 is a prime.
Together with 5010263051, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5010263051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2505131526 + 2505131527.
It is an arithmetic number, because the mean of its divisors is an integer number (2505131527).
Almost surely, 25010263053 is an apocalyptic number.
It is an amenable number.
5010263053 is a deficient number, since it is larger than the sum of its proper divisors (1).
5010263053 is an equidigital number, since it uses as much as digits as its factorization.
5010263053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 5010263053 is about 70783.2116606756. The cubic root of 5010263053 is about 1711.1451186742.
Adding to 5010263053 its reverse (3503620105), we get a palindrome (8513883158).
The spelling of 5010263053 in words is "five billion, ten million, two hundred sixty-three thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •