Base | Representation |
---|---|
bin | 1001011101100100… |
… | …01010000001000101 |
3 | 111010000200000010022 |
4 | 10232302022001011 |
5 | 40400421224321 |
6 | 2200023104525 |
7 | 236612106134 |
oct | 45662120105 |
9 | 14100600108 |
10 | 5079867461 |
11 | 21774a8679 |
12 | b992a2145 |
13 | 62c573846 |
14 | 36293191b |
15 | 1eae80dab |
hex | 12ec8a045 |
5079867461 has 4 divisors (see below), whose sum is σ = 5378683212. Its totient is φ = 4781051712.
The previous prime is 5079867433. The next prime is 5079867467. The reversal of 5079867461 is 1647689705.
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 1394649025 + 3685218436 = 37345^2 + 60706^2 .
It is a de Polignac number, because none of the positive numbers 2k-5079867461 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 (5079867467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 149407850 + ... + 149407883.
It is an arithmetic number, because the mean of its divisors is an integer number (1344670803).
Almost surely, 25079867461 is an apocalyptic number.
It is an amenable number.
5079867461 is a deficient number, since it is larger than the sum of its proper divisors (298815751).
5079867461 is a wasteful number, since it uses less digits than its factorization.
5079867461 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 298815750.
The product of its (nonzero) digits is 2540160, while the sum is 53.
The square root of 5079867461 is about 71273.1889352511. The cubic root of 5079867461 is about 1719.0326565506.
The spelling of 5079867461 in words is "five billion, seventy-nine million, eight hundred sixty-seven thousand, four hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •