Base | Representation |
---|---|
bin | 1001100110101100… |
… | …01010100111001101 |
3 | 111022100201001220111 |
4 | 10303112022213031 |
5 | 41030020302244 |
6 | 2211355520021 |
7 | 241531545436 |
oct | 46326124715 |
9 | 14270631814 |
10 | 5156415949 |
11 | 2206731693 |
12 | bbaa59011 |
13 | 642395bc9 |
14 | 36cb7a48d |
15 | 202a51e34 |
hex | 13358a9cd |
5156415949 has 4 divisors (see below), whose sum is σ = 5240947420. Its totient is φ = 5071884480.
The previous prime is 5156415937. The next prime is 5156415959. The reversal of 5156415949 is 9495146515.
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 374693449 + 4781722500 = 19357^2 + 69150^2 .
It is a cyclic number.
It is not a de Polignac number, because 5156415949 - 211 = 5156413901 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 (5156415959) 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 3 ways as a sum of consecutive naturals, for example, 42265644 + ... + 42265765.
It is an arithmetic number, because the mean of its divisors is an integer number (1310236855).
Almost surely, 25156415949 is an apocalyptic number.
It is an amenable number.
5156415949 is a deficient number, since it is larger than the sum of its proper divisors (84531471).
5156415949 is an equidigital number, since it uses as much as digits as its factorization.
5156415949 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 84531470.
The product of its digits is 972000, while the sum is 49.
The square root of 5156415949 is about 71808.1885929453. The cubic root of 5156415949 is about 1727.6243410870.
The spelling of 5156415949 in words is "five billion, one hundred fifty-six million, four hundred fifteen thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •