Base | Representation |
---|---|
bin | 1001110011000110… |
… | …01010010001101001 |
3 | 111120121112100211002 |
4 | 10321203022101221 |
5 | 41233141020422 |
6 | 2225554244345 |
7 | 244234251053 |
oct | 47143122151 |
9 | 14517470732 |
10 | 5260485737 |
11 | 225a452881 |
12 | 10298866b5 |
13 | 65ab02c70 |
14 | 37c90a8d3 |
15 | 20bc5c692 |
hex | 1398ca469 |
5260485737 has 4 divisors (see below), whose sum is σ = 5665138500. Its totient is φ = 4855832976.
The previous prime is 5260485679. The next prime is 5260485739. The reversal of 5260485737 is 7375840625.
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 823460416 + 4437025321 = 28696^2 + 66611^2 .
It is a cyclic number.
It is not a de Polignac number, because 5260485737 - 214 = 5260469353 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5260485691 and 5260485700.
It is not an unprimeable number, because it can be changed into a prime (5260485739) 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, 202326362 + ... + 202326387.
It is an arithmetic number, because the mean of its divisors is an integer number (1416284625).
Almost surely, 25260485737 is an apocalyptic number.
It is an amenable number.
5260485737 is a deficient number, since it is larger than the sum of its proper divisors (404652763).
5260485737 is a wasteful number, since it uses less digits than its factorization.
5260485737 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 404652762.
The product of its (nonzero) digits is 1411200, while the sum is 47.
The square root of 5260485737 is about 72529.2060965788. The cubic root of 5260485737 is about 1739.1696545691.
The spelling of 5260485737 in words is "five billion, two hundred sixty million, four hundred eighty-five thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •