Base | Representation |
---|---|
bin | 101111001100011001… |
… | …101010111001110000 |
3 | 11211210112220221022220 |
4 | 233030121222321300 |
5 | 1312240010443043 |
6 | 35140154001040 |
7 | 3442514140620 |
oct | 571431527160 |
9 | 154715827286 |
10 | 50673921648 |
11 | 1a544120399 |
12 | 99a2716180 |
13 | 4a1757b12c |
14 | 264a03a880 |
15 | 14b8b15483 |
hex | bcc66ae70 |
50673921648 has 80 divisors (see below), whose sum is σ = 149822839296. Its totient is φ = 14457542400.
The previous prime is 50673921631. The next prime is 50673921653. The reversal of 50673921648 is 84612937605.
It is a self number, because there is not a number n which added to its sum of digits gives 50673921648.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 127965 + ... + 343107.
It is a 1-persistent number, because it is pandigital, but 2⋅50673921648 = 101347843296 is not.
Almost surely, 250673921648 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 50673921648, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74911419648).
50673921648 is an abundant number, since it is smaller than the sum of its proper divisors (99148917648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50673921648 is a wasteful number, since it uses less digits than its factorization.
50673921648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 215862 (or 215856 counting only the distinct ones).
The product of its (nonzero) digits is 2177280, while the sum is 51.
The spelling of 50673921648 in words is "fifty billion, six hundred seventy-three million, nine hundred twenty-one thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •