Base | Representation |
---|---|
bin | 101110101010111110… |
… | …011010111101110000 |
3 | 11210100110200210021220 |
4 | 232222332122331300 |
5 | 1310112430132402 |
6 | 35004402145040 |
7 | 3422564402565 |
oct | 565276327560 |
9 | 153313623256 |
10 | 50113130352 |
11 | 1a28661260a |
12 | 9866952180 |
13 | 495832cb6c |
14 | 25d577c86c |
15 | 148478edbc |
hex | baaf9af70 |
50113130352 has 160 divisors (see below), whose sum is σ = 139815051264. Its totient is φ = 15434803200.
The previous prime is 50113130351. The next prime is 50113130359. The reversal of 50113130352 is 25303131105.
It is a super-2 number, since 2×501131303522 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50113130351) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 2858638 + ... + 2876114.
Almost surely, 250113130352 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 50113130352, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69907525632).
50113130352 is an abundant number, since it is smaller than the sum of its proper divisors (89701920912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50113130352 is a wasteful number, since it uses less digits than its factorization.
50113130352 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17607 (or 17601 counting only the distinct ones).
The product of its (nonzero) digits is 1350, while the sum is 24.
Adding to 50113130352 its reverse (25303131105), we get a palindrome (75416261457).
The spelling of 50113130352 in words is "fifty billion, one hundred thirteen million, one hundred thirty thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •