Base | Representation |
---|---|
bin | 1001110011010010… |
… | …10101100000011101 |
3 | 111120201120121111011 |
4 | 10321221111200131 |
5 | 41234044321410 |
6 | 2230053055221 |
7 | 244254102562 |
oct | 47151254035 |
9 | 14521517434 |
10 | 5262104605 |
11 | 226035908a |
12 | 102a327511 |
13 | 65b24ba84 |
14 | 37cc0c869 |
15 | 20be7c18a |
hex | 139a5581d |
5262104605 has 8 divisors (see below), whose sum is σ = 6685968312. Its totient is φ = 3962055168.
The previous prime is 5262104593. The next prime is 5262104609. The reversal of 5262104605 is 5064012625.
It can be written as a sum of positive squares in 4 ways, for example, as 2945992729 + 2316111876 = 54277^2 + 48126^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5262104605 - 211 = 5262102557 is a prime.
It is a super-3 number, since 3×52621046053 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5262104609) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30953472 + ... + 30953641.
It is an arithmetic number, because the mean of its divisors is an integer number (835746039).
Almost surely, 25262104605 is an apocalyptic number.
It is an amenable number.
5262104605 is a deficient number, since it is larger than the sum of its proper divisors (1423863707).
5262104605 is a wasteful number, since it uses less digits than its factorization.
5262104605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61907135.
The product of its (nonzero) digits is 14400, while the sum is 31.
The square root of 5262104605 is about 72540.3653492316. The cubic root of 5262104605 is about 1739.3480409690.
The spelling of 5262104605 in words is "five billion, two hundred sixty-two million, one hundred four thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •