Base | Representation |
---|---|
bin | 1000100001110111… |
… | …11111111001101101 |
3 | 102211010102221211001 |
4 | 10100323333321231 |
5 | 33334224142424 |
6 | 2034214400301 |
7 | 221321654056 |
oct | 42073777155 |
9 | 12733387731 |
10 | 4579130989 |
11 | 1a3a888984 |
12 | a79660091 |
13 | 57c8c1484 |
14 | 31622772d |
15 | 1bc01e844 |
hex | 110effe6d |
4579130989 has 4 divisors (see below), whose sum is σ = 4702891324. Its totient is φ = 4455370656.
The previous prime is 4579130987. The next prime is 4579131023. The reversal of 4579130989 is 9890319754.
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 3659040100 + 920090889 = 60490^2 + 30333^2 .
It is a cyclic number.
It is not a de Polignac number, because 4579130989 - 21 = 4579130987 is a prime.
It is a super-2 number, since 2×45791309892 = 41936881228840236242, which contains 22 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 (4579130987) 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, 61880112 + ... + 61880185.
It is an arithmetic number, because the mean of its divisors is an integer number (1175722831).
Almost surely, 24579130989 is an apocalyptic number.
It is an amenable number.
4579130989 is a deficient number, since it is larger than the sum of its proper divisors (123760335).
4579130989 is a wasteful number, since it uses less digits than its factorization.
4579130989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 123760334.
The product of its (nonzero) digits is 2449440, while the sum is 55.
The square root of 4579130989 is about 67669.2765514750. The cubic root of 4579130989 is about 1660.5846623224.
The spelling of 4579130989 in words is "four billion, five hundred seventy-nine million, one hundred thirty thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •