Base | Representation |
---|---|
bin | 101110011010101110… |
… | …101010000101000100 |
3 | 11202122110210220111021 |
4 | 232122232222011010 |
5 | 1304033141000000 |
6 | 34521344120524 |
7 | 3413044535251 |
oct | 563256520504 |
9 | 152573726437 |
10 | 49840562500 |
11 | 1a156775323 |
12 | 97ab606144 |
13 | 4913a18301 |
14 | 25ab4aa428 |
15 | 146a89e11a |
hex | b9abaa144 |
49840562500 has 189 divisors, whose sum is σ = 117565272489. Its totient is φ = 18485100000.
The previous prime is 49840562441. The next prime is 49840562509. The reversal of 49840562500 is 526504894.
The square root of 49840562500 is 223250.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 3 ways, for example, as 43665117444 + 6175445056 = 208962^2 + 78584^2 .
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (49840562509) 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 62 ways as a sum of consecutive naturals, for example, 1060437477 + ... + 1060437523.
Almost surely, 249840562500 is an apocalyptic number.
49840562500 is the 223250-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 49840562500
49840562500 is an abundant number, since it is smaller than the sum of its proper divisors (67724709989).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49840562500 is an frugal number, since it uses more digits than its factorization.
49840562500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 166 (or 73 counting only the distinct ones).
The product of its (nonzero) digits is 345600, while the sum is 43.
The spelling of 49840562500 in words is "forty-nine billion, eight hundred forty million, five hundred sixty-two thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •