Base | Representation |
---|---|
bin | 1001010100110001… |
… | …00100001011010001 |
3 | 110220212202200121022 |
4 | 10222120210023101 |
5 | 40223022100001 |
6 | 2144425005225 |
7 | 235024502651 |
oct | 45230441321 |
9 | 13825680538 |
10 | 5006050001 |
11 | 213986a507 |
12 | b78623815 |
13 | 61a199584 |
14 | 356bd8361 |
15 | 1e474e11b |
hex | 12a6242d1 |
5006050001 has 2 divisors, whose sum is σ = 5006050002. Its totient is φ = 5006050000.
The previous prime is 5006049967. The next prime is 5006050009. The reversal of 5006050001 is 1000506005.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4986478225 + 19571776 = 70615^2 + 4424^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5006050001 is a prime.
It is a super-2 number, since 2×50060500012 = 50121073225024200002, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5006050009) 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, 2503025000 + 2503025001.
It is an arithmetic number, because the mean of its divisors is an integer number (2503025001).
Almost surely, 25006050001 is an apocalyptic number.
It is an amenable number.
5006050001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5006050001 is an equidigital number, since it uses as much as digits as its factorization.
5006050001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 17.
The square root of 5006050001 is about 70753.4451528687. The cubic root of 5006050001 is about 1710.6653591009.
Adding to 5006050001 its reverse (1000506005), we get a palindrome (6006556006).
The spelling of 5006050001 in words is "five billion, six million, fifty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •