Base | Representation |
---|---|
bin | 10111001011101111010111… |
… | …01111001011100000101100 |
3 | 20200111201200002200020201001 |
4 | 23211313223233023200230 |
5 | 23140232411443144100 |
6 | 300232151232530044 |
7 | 13511151524524240 |
oct | 1345675357134054 |
9 | 220451602606631 |
10 | 50980921849900 |
11 | 15275984350489 |
12 | 587453b6b0924 |
13 | 225a6322ba9b3 |
14 | c836bdd72420 |
15 | 5d61e6550d6a |
hex | 2e5debbcb82c |
50980921849900 has 144 divisors (see below), whose sum is σ = 129856866225856. Its totient is φ = 17005835796480.
The previous prime is 50980921849889. The next prime is 50980921850009. The reversal of 50980921849900 is 994812908905.
It is a super-2 number, since 2×509809218499002 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 607908772 + ... + 607992628.
Almost surely, 250980921849900 is an apocalyptic number.
50980921849900 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50980921849900, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64928433112928).
50980921849900 is an abundant number, since it is smaller than the sum of its proper divisors (78875944375956).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50980921849900 is a wasteful number, since it uses less digits than its factorization.
50980921849900 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107388 (or 107381 counting only the distinct ones).
The product of its (nonzero) digits is 16796160, while the sum is 64.
The spelling of 50980921849900 in words is "fifty trillion, nine hundred eighty billion, nine hundred twenty-one million, eight hundred forty-nine thousand, nine hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •