Base | Representation |
---|---|
bin | 101101101000111101… |
… | …001010101001110001 |
3 | 11200111021111121010210 |
4 | 231220331022221301 |
5 | 1300330402131022 |
6 | 34302434014333 |
7 | 3353254630551 |
oct | 555075125161 |
9 | 150437447123 |
10 | 49005505137 |
11 | 1986836a376 |
12 | 95b7a173a9 |
13 | 480ca0c524 |
14 | 252c617161 |
15 | 141c3eea0c |
hex | b68f4aa71 |
49005505137 has 8 divisors (see below), whose sum is σ = 65576561536. Its totient is φ = 32552392752.
The previous prime is 49005505123. The next prime is 49005505139. The reversal of 49005505137 is 73150550094.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 49005505137 - 211 = 49005503089 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 49005505095 and 49005505104.
It is not an unprimeable number, because it can be changed into a prime (49005505139) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 29485033 + ... + 29486694.
It is an arithmetic number, because the mean of its divisors is an integer number (8197070192).
Almost surely, 249005505137 is an apocalyptic number.
It is an amenable number.
49005505137 is a deficient number, since it is larger than the sum of its proper divisors (16571056399).
49005505137 is a wasteful number, since it uses less digits than its factorization.
49005505137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58972007.
The product of its (nonzero) digits is 94500, while the sum is 39.
The spelling of 49005505137 in words is "forty-nine billion, five million, five hundred five thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •