Base | Representation |
---|---|
bin | 101101101101000111… |
… | …110000010100000101 |
3 | 11200200011000002201222 |
4 | 231231013300110011 |
5 | 1301001244432301 |
6 | 34313411530125 |
7 | 3355063633622 |
oct | 555507602405 |
9 | 150604002658 |
10 | 49075389701 |
11 | 198a3861708 |
12 | 96172b9945 |
13 | 482133a640 |
14 | 2537a09349 |
15 | 142360631b |
hex | b6d1f0505 |
49075389701 has 8 divisors (see below), whose sum is σ = 53639232864. Its totient is φ = 44624234160.
The previous prime is 49075389679. The next prime is 49075389709. The reversal of 49075389701 is 10798357094.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-49075389701 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 (49075389709) 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 7 ways as a sum of consecutive naturals, for example, 28170995 + ... + 28172736.
It is an arithmetic number, because the mean of its divisors is an integer number (6704904108).
Almost surely, 249075389701 is an apocalyptic number.
It is an amenable number.
49075389701 is a deficient number, since it is larger than the sum of its proper divisors (4563843163).
49075389701 is a wasteful number, since it uses less digits than its factorization.
49075389701 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56343811.
The product of its (nonzero) digits is 1905120, while the sum is 53.
The spelling of 49075389701 in words is "forty-nine billion, seventy-five million, three hundred eighty-nine thousand, seven hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •