Base | Representation |
---|---|
bin | 1001010100010110… |
… | …01011101110110001 |
3 | 110220122011110112101 |
4 | 10222023023232301 |
5 | 40221122321001 |
6 | 2144221500401 |
7 | 234652622362 |
oct | 45213135661 |
9 | 13818143471 |
10 | 5002542001 |
11 | 2137893936 |
12 | b77411701 |
13 | 61953b932 |
14 | 356563b69 |
15 | 1e42a9a01 |
hex | 12a2cbbb1 |
5002542001 has 2 divisors, whose sum is σ = 5002542002. Its totient is φ = 5002542000.
The previous prime is 5002541989. The next prime is 5002542023. The reversal of 5002542001 is 1002452005.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2937748401 + 2064793600 = 54201^2 + 45440^2 .
It is a cyclic number.
It is not a de Polignac number, because 5002542001 - 221 = 5000444849 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5002542001.
It is not a weakly prime, because it can be changed into another prime (5002542071) 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, 2501271000 + 2501271001.
It is an arithmetic number, because the mean of its divisors is an integer number (2501271001).
Almost surely, 25002542001 is an apocalyptic number.
It is an amenable number.
5002542001 is a deficient number, since it is larger than the sum of its proper divisors (1).
5002542001 is an equidigital number, since it uses as much as digits as its factorization.
5002542001 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 400, while the sum is 19.
The square root of 5002542001 is about 70728.6504961038. The cubic root of 5002542001 is about 1710.2656816196.
Adding to 5002542001 its reverse (1002452005), we get a palindrome (6004994006).
The spelling of 5002542001 in words is "five billion, two million, five hundred forty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •