Base | Representation |
---|---|
bin | 1001110111000110… |
… | …11101001100001111 |
3 | 111122221211001010101 |
4 | 10323203131030033 |
5 | 41320243231042 |
6 | 2233155151531 |
7 | 245123154220 |
oct | 47343351417 |
9 | 14587731111 |
10 | 5294117647 |
11 | 2277433a45 |
12 | 1038ba55a7 |
13 | 664a7a0c0 |
14 | 383183247 |
15 | 20eba26b7 |
hex | 13b8dd30f |
5294117647 has 32 divisors (see below), whose sum is σ = 6670669824. Its totient is φ = 4089657600.
The previous prime is 5294117599. The next prime is 5294117651. The reversal of 5294117647 is 7467114925.
It is a de Polignac number, because none of the positive numbers 2k-5294117647 is a prime.
It is a Smith number, since the sum of its digits (46) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a junction number, because it is equal to n+sod(n) for n = 5294117597 and 5294117606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5294117347) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2098747 + ... + 2101267.
It is an arithmetic number, because the mean of its divisors is an integer number (208458432).
Almost surely, 25294117647 is an apocalyptic number.
5294117647 is a deficient number, since it is larger than the sum of its proper divisors (1376552177).
5294117647 is a wasteful number, since it uses less digits than its factorization.
5294117647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3079.
The product of its digits is 423360, while the sum is 46.
The square root of 5294117647 is about 72760.6875104957. The cubic root of 5294117647 is about 1742.8681334717.
The spelling of 5294117647 in words is "five billion, two hundred ninety-four million, one hundred seventeen thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •