Base | Representation |
---|---|
bin | 1001110011010011… |
… | …10001101011010001 |
3 | 111120201210110202111 |
4 | 10321221301223101 |
5 | 41234112014420 |
6 | 2230055345321 |
7 | 244255063141 |
oct | 47151615321 |
9 | 14521713674 |
10 | 5262219985 |
11 | 2260427840 |
12 | 102a382241 |
13 | 65b28c449 |
14 | 37cc3c921 |
15 | 20bea145a |
hex | 139a71ad1 |
5262219985 has 8 divisors (see below), whose sum is σ = 6888724416. Its totient is φ = 3827069040.
The previous prime is 5262219973. The next prime is 5262219997. The reversal of 5262219985 is 5899122625.
It is an interprime number because it is at equal distance from previous prime (5262219973) and next prime (5262219997).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 5262219985 - 213 = 5262211793 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 (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 47838309 + ... + 47838418.
It is an arithmetic number, because the mean of its divisors is an integer number (861090552).
Almost surely, 25262219985 is an apocalyptic number.
5262219985 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
5262219985 is a deficient number, since it is larger than the sum of its proper divisors (1626504431).
5262219985 is a wasteful number, since it uses less digits than its factorization.
5262219985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95676743.
The product of its digits is 777600, while the sum is 49.
The square root of 5262219985 is about 72541.1606262265. The cubic root of 5262219985 is about 1739.3607535321.
The spelling of 5262219985 in words is "five billion, two hundred sixty-two million, two hundred nineteen thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •