Base | Representation |
---|---|
bin | 10110110000101110100000… |
… | …11001100001001000110100 |
3 | 20120012222220020001122021010 |
4 | 23120113100121201020310 |
5 | 23030031013031004143 |
6 | 254241525510152220 |
7 | 13354122545230053 |
oct | 1330272031411064 |
9 | 216188806048233 |
10 | 50052750250548 |
11 | 14a4828570a081 |
12 | 5744684952670 |
13 | 21c0c531c1896 |
14 | c507cd2cc39a |
15 | 5bbec0bb3a33 |
hex | 2d85d0661234 |
50052750250548 has 24 divisors (see below), whose sum is σ = 118434676651200. Its totient is φ = 16449260645440.
The previous prime is 50052750250543. The next prime is 50052750250549. The reversal of 50052750250548 is 84505205725005.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 50052750250497 and 50052750250506.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50052750250543) by changing a digit.
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, 29373678873 + ... + 29373680576.
It is an arithmetic number, because the mean of its divisors is an integer number (4934778193800).
Almost surely, 250052750250548 is an apocalyptic number.
It is an amenable number.
50052750250548 is an abundant number, since it is smaller than the sum of its proper divisors (68381926400652).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50052750250548 is a wasteful number, since it uses less digits than its factorization.
50052750250548 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58747359527 (or 58747359525 counting only the distinct ones).
The product of its (nonzero) digits is 2800000, while the sum is 48.
The spelling of 50052750250548 in words is "fifty trillion, fifty-two billion, seven hundred fifty million, two hundred fifty thousand, five hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •