Base | Representation |
---|---|
bin | 1001111011011100… |
… | …10110111111000001 |
3 | 111202111022222210222 |
4 | 10331232112333001 |
5 | 41404103431431 |
6 | 2240535432425 |
7 | 246044521331 |
oct | 47556267701 |
9 | 14674288728 |
10 | 5330530241 |
11 | 2295a442a3 |
12 | 1049225715 |
13 | 66c488b0a |
14 | 387d410c1 |
15 | 212e9657b |
hex | 13db96fc1 |
5330530241 has 2 divisors, whose sum is σ = 5330530242. Its totient is φ = 5330530240.
The previous prime is 5330530187. The next prime is 5330530243. The reversal of 5330530241 is 1420350335.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4964611600 + 365918641 = 70460^2 + 19129^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5330530241 is a prime.
Together with 5330530243, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5330530241.
It is not a weakly prime, because it can be changed into another prime (5330530243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2665265120 + 2665265121.
It is an arithmetic number, because the mean of its divisors is an integer number (2665265121).
Almost surely, 25330530241 is an apocalyptic number.
It is an amenable number.
5330530241 is a deficient number, since it is larger than the sum of its proper divisors (1).
5330530241 is an equidigital number, since it uses as much as digits as its factorization.
5330530241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 5400, while the sum is 26.
The square root of 5330530241 is about 73010.4803504264. The cubic root of 5330530241 is about 1746.8547849940.
Adding to 5330530241 its reverse (1420350335), we get a palindrome (6750880576).
The spelling of 5330530241 in words is "five billion, three hundred thirty million, five hundred thirty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •