Base | Representation |
---|---|
bin | 1001011101000000… |
… | …01010001101010001 |
3 | 111002200210022111112 |
4 | 10232200022031101 |
5 | 40343214242044 |
6 | 2155334023105 |
7 | 236524026443 |
oct | 45640121521 |
9 | 14080708445 |
10 | 5075149649 |
11 | 2174876059 |
12 | b977a7a95 |
13 | 62b5b133b |
14 | 362064493 |
15 | 1ea84d09e |
hex | 12e80a351 |
5075149649 has 2 divisors, whose sum is σ = 5075149650. Its totient is φ = 5075149648.
The previous prime is 5075149633. The next prime is 5075149687. The reversal of 5075149649 is 9469415705.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5060188225 + 14961424 = 71135^2 + 3868^2 .
It is a cyclic number.
It is not a de Polignac number, because 5075149649 - 24 = 5075149633 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 5075149597 and 5075149606.
It is not a weakly prime, because it can be changed into another prime (5075149619) 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 as a sum of consecutive naturals, namely, 2537574824 + 2537574825.
It is an arithmetic number, because the mean of its divisors is an integer number (2537574825).
Almost surely, 25075149649 is an apocalyptic number.
It is an amenable number.
5075149649 is a deficient number, since it is larger than the sum of its proper divisors (1).
5075149649 is an equidigital number, since it uses as much as digits as its factorization.
5075149649 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1360800, while the sum is 50.
The square root of 5075149649 is about 71240.0845662047. The cubic root of 5075149649 is about 1718.5003208197.
The spelling of 5075149649 in words is "five billion, seventy-five million, one hundred forty-nine thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •