Base | Representation |
---|---|
bin | 101110111000110011… |
… | …111011101001000000 |
3 | 11210221122111021112201 |
4 | 232320303323221000 |
5 | 1311101341333012 |
6 | 35043413402544 |
7 | 3431413443301 |
oct | 567063735100 |
9 | 153848437481 |
10 | 50345261632 |
11 | 1a395651246 |
12 | 9910639454 |
13 | 4994457253 |
14 | 26185267a8 |
15 | 1499d44857 |
hex | bb8cfba40 |
50345261632 has 56 divisors (see below), whose sum is σ = 101452753152. Its totient is φ = 24783360000.
The previous prime is 50345261627. The next prime is 50345261671. The reversal of 50345261632 is 23616254305.
It is a junction number, because it is equal to n+sod(n) for n = 50345261591 and 50345261600.
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 7 ways as a sum of consecutive naturals, for example, 3405168 + ... + 3419920.
Almost surely, 250345261632 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 50345261632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50726376576).
50345261632 is an abundant number, since it is smaller than the sum of its proper divisors (51107491520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50345261632 is a wasteful number, since it uses less digits than its factorization.
50345261632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15587 (or 15577 counting only the distinct ones).
The product of its (nonzero) digits is 129600, while the sum is 37.
The spelling of 50345261632 in words is "fifty billion, three hundred forty-five million, two hundred sixty-one thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •