Base | Representation |
---|---|
bin | 101110001010100111… |
… | …001010000000000001 |
3 | 11201221122000001212121 |
4 | 232022213022000001 |
5 | 1303004430120031 |
6 | 34434444324241 |
7 | 3403252261531 |
oct | 561247120001 |
9 | 151848001777 |
10 | 49570160641 |
11 | 1a028077411 |
12 | 9734b43681 |
13 | 489c9b1601 |
14 | 25835dd4c1 |
15 | 1451c8a011 |
hex | b8a9ca001 |
49570160641 has 8 divisors (see below), whose sum is σ = 49722062400. Its totient is φ = 49418473680.
The previous prime is 49570160611. The next prime is 49570160677. The reversal of 49570160641 is 14606107594.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 49570160641 - 223 = 49561772033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49570160611) 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 in 7 ways as a sum of consecutive naturals, for example, 414786 + ... + 520756.
It is an arithmetic number, because the mean of its divisors is an integer number (6215257800).
Almost surely, 249570160641 is an apocalyptic number.
It is an amenable number.
49570160641 is a deficient number, since it is larger than the sum of its proper divisors (151901759).
49570160641 is a wasteful number, since it uses less digits than its factorization.
49570160641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107399.
The product of its (nonzero) digits is 181440, while the sum is 43.
The spelling of 49570160641 in words is "forty-nine billion, five hundred seventy million, one hundred sixty thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •