Base | Representation |
---|---|
bin | 1001100100011001… |
… | …11100000000000001 |
3 | 111021000120210110001 |
4 | 10302030330000001 |
5 | 41010112011320 |
6 | 2205432240001 |
7 | 241206434401 |
oct | 46214740001 |
9 | 14230523401 |
10 | 5137219585 |
11 | 21a6910123 |
12 | bb4540001 |
13 | 63b404504 |
14 | 36a3c0801 |
15 | 20100e20a |
hex | 13233c001 |
5137219585 has 4 divisors (see below), whose sum is σ = 6164663508. Its totient is φ = 4109775664.
The previous prime is 5137219567. The next prime is 5137219597. The reversal of 5137219585 is 5859127315.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5859127315 = 5 ⋅1171825463.
It can be written as a sum of positive squares in 2 ways, for example, as 642723904 + 4494495681 = 25352^2 + 67041^2 .
It is a cyclic number.
It is not a de Polignac number, because 5137219585 - 25 = 5137219553 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 513721954 + ... + 513721963.
It is an arithmetic number, because the mean of its divisors is an integer number (1541165877).
Almost surely, 25137219585 is an apocalyptic number.
It is an amenable number.
5137219585 is a deficient number, since it is larger than the sum of its proper divisors (1027443923).
5137219585 is a wasteful number, since it uses less digits than its factorization.
5137219585 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1027443922.
The product of its digits is 378000, while the sum is 46.
The square root of 5137219585 is about 71674.3997882089. The cubic root of 5137219585 is about 1725.4778019705.
The spelling of 5137219585 in words is "five billion, one hundred thirty-seven million, two hundred nineteen thousand, five hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •