Base | Representation |
---|---|
bin | 101101101100011010… |
… | …100101110100101010 |
3 | 11200122022201121001210 |
4 | 231230122211310222 |
5 | 1300440232102000 |
6 | 34312310053550 |
7 | 3354561203361 |
oct | 555432456452 |
9 | 150568647053 |
10 | 49063550250 |
11 | 19898105540 |
12 | 961334a2b6 |
13 | 481ba53750 |
14 | 25362067d8 |
15 | 1422568350 |
hex | b6c6a5d2a |
49063550250 has 128 divisors (see below), whose sum is σ = 143872485120. Its totient is φ = 10979232000.
The previous prime is 49063550231. The next prime is 49063550287. The reversal of 49063550250 is 5205536094.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 49063550199 and 49063550208.
It is an unprimeable number.
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 63 ways as a sum of consecutive naturals, for example, 121485 + ... + 335984.
It is an arithmetic number, because the mean of its divisors is an integer number (1124003790).
Almost surely, 249063550250 is an apocalyptic number.
49063550250 is an abundant number, since it is smaller than the sum of its proper divisors (94808934870).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49063550250 is a wasteful number, since it uses less digits than its factorization.
49063550250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 457513 (or 457503 counting only the distinct ones).
The product of its (nonzero) digits is 162000, while the sum is 39.
The spelling of 49063550250 in words is "forty-nine billion, sixty-three million, five hundred fifty thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •