Base | Representation |
---|---|
bin | 10110111101010110110101… |
… | …00011011100110111000000 |
3 | 20121202111000210021001222110 |
4 | 23132223122203130313000 |
5 | 23104133241323323040 |
6 | 255213135255335320 |
7 | 13430354540051064 |
oct | 1336533243346700 |
9 | 217674023231873 |
10 | 50486712323520 |
11 | 150a5326a14580 |
12 | 57b47b5981540 |
13 | 2222b519c7595 |
14 | c677d9bb9aa4 |
15 | 5c841de68980 |
hex | 2deada8dcdc0 |
50486712323520 has 224 divisors, whose sum is σ = 174954988834560. Its totient is φ = 12233087426560.
The previous prime is 50486712323519. The next prime is 50486712323561. The reversal of 50486712323520 is 2532321768405.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a self number, because there is not a number n which added to its sum of digits gives 50486712323520.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 19958236 + ... + 22345124.
Almost surely, 250486712323520 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50486712323520, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87477494417280).
50486712323520 is an abundant number, since it is smaller than the sum of its proper divisors (124468276511040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50486712323520 is a wasteful number, since it uses less digits than its factorization.
50486712323520 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2388923 (or 2388913 counting only the distinct ones).
The product of its (nonzero) digits is 2419200, while the sum is 48.
The spelling of 50486712323520 in words is "fifty trillion, four hundred eighty-six billion, seven hundred twelve million, three hundred twenty-three thousand, five hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •