Base | Representation |
---|---|
bin | 1001010100111110… |
… | …00111110000001101 |
3 | 110221000000000001201 |
4 | 10222133013300031 |
5 | 40223442043324 |
6 | 2144525505501 |
7 | 235045221265 |
oct | 45237076015 |
9 | 13830000051 |
10 | 5007768589 |
11 | 213a83372a |
12 | b79112291 |
13 | 61a64b8a5 |
14 | 3571247a5 |
15 | 1e498d444 |
hex | 12a7c7c0d |
5007768589 has 8 divisors (see below), whose sum is σ = 5147860760. Its totient is φ = 4867926336.
The previous prime is 5007768583. The next prime is 5007768629. The reversal of 5007768589 is 9858677005.
It can be written as a sum of positive squares in 4 ways, for example, as 3392130564 + 1615638025 = 58242^2 + 40195^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 5007768589 - 27 = 5007768461 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 (5007768583) by changing a digit.
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, 21474 + ... + 102355.
It is an arithmetic number, because the mean of its divisors is an integer number (643482595).
Almost surely, 25007768589 is an apocalyptic number.
It is an amenable number.
5007768589 is a deficient number, since it is larger than the sum of its proper divisors (140092171).
5007768589 is a wasteful number, since it uses less digits than its factorization.
5007768589 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 124959.
The product of its (nonzero) digits is 4233600, while the sum is 55.
The square root of 5007768589 is about 70765.5890175444. The cubic root of 5007768589 is about 1710.8610950999.
The spelling of 5007768589 in words is "five billion, seven million, seven hundred sixty-eight thousand, five hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •