Base | Representation |
---|---|
bin | 1001101011111010… |
… | …10101111110011101 |
3 | 111102102011120221112 |
4 | 10311331111332131 |
5 | 41122230144131 |
6 | 2220003111405 |
7 | 242603213066 |
oct | 46575257635 |
9 | 14372146845 |
10 | 5200240541 |
11 | 2229444761 |
12 | 1011672565 |
13 | 64b49b512 |
14 | 37490756d |
15 | 20680c02b |
hex | 135f55f9d |
5200240541 has 4 divisors (see below), whose sum is σ = 5258670300. Its totient is φ = 5141810784.
The previous prime is 5200240501. The next prime is 5200240547. The reversal of 5200240541 is 1450420025.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1384584100 + 3815656441 = 37210^2 + 61771^2 .
It is a cyclic number.
It is not a de Polignac number, because 5200240541 - 218 = 5199978397 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5200240547) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29214746 + ... + 29214923.
It is an arithmetic number, because the mean of its divisors is an integer number (1314667575).
Almost surely, 25200240541 is an apocalyptic number.
It is an amenable number.
5200240541 is a deficient number, since it is larger than the sum of its proper divisors (58429759).
5200240541 is an equidigital number, since it uses as much as digits as its factorization.
5200240541 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 58429758.
The product of its (nonzero) digits is 1600, while the sum is 23.
The square root of 5200240541 is about 72112.6933417412. The cubic root of 5200240541 is about 1732.5049238623.
Adding to 5200240541 its reverse (1450420025), we get a palindrome (6650660566).
The spelling of 5200240541 in words is "five billion, two hundred million, two hundred forty thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •