Base | Representation |
---|---|
bin | 1001111110100101… |
… | …01000101000110101 |
3 | 111211022210111101202 |
4 | 10333102220220311 |
5 | 41432321120244 |
6 | 2243315102245 |
7 | 246514123061 |
oct | 47722505065 |
9 | 14738714352 |
10 | 5356816949 |
11 | 22a9868950 |
12 | 1055ba1985 |
13 | 674a60893 |
14 | 38b624aa1 |
15 | 21543a04e |
hex | 13f4a8a35 |
5356816949 has 8 divisors (see below), whose sum is σ = 5904046848. Its totient is φ = 4819628160.
The previous prime is 5356816919. The next prime is 5356816981. The reversal of 5356816949 is 9496186535.
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 5356816949 - 220 = 5355768373 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5356816894 and 5356816903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5356816919) 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, 2509157 + ... + 2511290.
It is an arithmetic number, because the mean of its divisors is an integer number (738005856).
Almost surely, 25356816949 is an apocalyptic number.
It is an amenable number.
5356816949 is a deficient number, since it is larger than the sum of its proper divisors (547229899).
5356816949 is a wasteful number, since it uses less digits than its factorization.
5356816949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5020555.
The product of its digits is 6998400, while the sum is 56.
The square root of 5356816949 is about 73190.2790608152. The cubic root of 5356816949 is about 1749.7215283704.
The spelling of 5356816949 in words is "five billion, three hundred fifty-six million, eight hundred sixteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •