Base | Representation |
---|---|
bin | 1001010110000000… |
… | …00000110100100101 |
3 | 110221121020001201101 |
4 | 10223000000310211 |
5 | 40233144002244 |
6 | 2145434400101 |
7 | 235211422333 |
oct | 45300006445 |
9 | 13847201641 |
10 | 5016390949 |
11 | 2144692849 |
12 | b7bb90031 |
13 | 61c37a38b |
14 | 35832ab53 |
15 | 1e55e30d4 |
hex | 12b000d25 |
5016390949 has 2 divisors, whose sum is σ = 5016390950. Its totient is φ = 5016390948.
The previous prime is 5016390947. The next prime is 5016390979. The reversal of 5016390949 is 9490936105.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4513824225 + 502566724 = 67185^2 + 22418^2 .
It is a cyclic number.
It is not a de Polignac number, because 5016390949 - 21 = 5016390947 is a prime.
Together with 5016390947, it forms a pair of twin primes.
It is a junction number, because it is equal to n+sod(n) for n = 5016390899 and 5016390908.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5016390947) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2508195474 + 2508195475.
It is an arithmetic number, because the mean of its divisors is an integer number (2508195475).
Almost surely, 25016390949 is an apocalyptic number.
It is an amenable number.
5016390949 is a deficient number, since it is larger than the sum of its proper divisors (1).
5016390949 is an equidigital number, since it uses as much as digits as its factorization.
5016390949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 262440, while the sum is 46.
The square root of 5016390949 is about 70826.4847991202. The cubic root of 5016390949 is about 1711.8424504777.
The spelling of 5016390949 in words is "five billion, sixteen million, three hundred ninety thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •