Base | Representation |
---|---|
bin | 101101110111100000… |
… | …010111110011010101 |
3 | 11201010021211200000002 |
4 | 231313200113303111 |
5 | 1301330400140221 |
6 | 34342554101045 |
7 | 3362310551363 |
oct | 556740276325 |
9 | 151107750002 |
10 | 49249615061 |
11 | 1998313a809 |
12 | 966571a785 |
13 | 484b46bc7a |
14 | 2552bdc633 |
15 | 1433a6d80b |
hex | b77817cd5 |
49249615061 has 2 divisors, whose sum is σ = 49249615062. Its totient is φ = 49249615060.
The previous prime is 49249615039. The next prime is 49249615249. The reversal of 49249615061 is 16051694294.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 28012382161 + 21237232900 = 167369^2 + 145730^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49249615061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 49249614997 and 49249615015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49249615001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24624807530 + 24624807531.
It is an arithmetic number, because the mean of its divisors is an integer number (24624807531).
Almost surely, 249249615061 is an apocalyptic number.
It is an amenable number.
49249615061 is a deficient number, since it is larger than the sum of its proper divisors (1).
49249615061 is an equidigital number, since it uses as much as digits as its factorization.
49249615061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 466560, while the sum is 47.
The spelling of 49249615061 in words is "forty-nine billion, two hundred forty-nine million, six hundred fifteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •