Base | Representation |
---|---|
bin | 101110110111111101… |
… | …111101100000111100 |
3 | 11210220122212111000000 |
4 | 232313331331200330 |
5 | 1311034231113112 |
6 | 35042150234300 |
7 | 3431152256220 |
oct | 566775754074 |
9 | 153818774000 |
10 | 50331113532 |
11 | 1a3886685a7 |
12 | 9907955990 |
13 | 49915425ab |
14 | 26166c2780 |
15 | 149899c7dc |
hex | bb7f7d83c |
50331113532 has 336 divisors, whose sum is σ = 160907507712. Its totient is φ = 13456523520.
The previous prime is 50331113527. The next prime is 50331113551. The reversal of 50331113532 is 23531113305.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 50331113496 and 50331113505.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 111 ways as a sum of consecutive naturals, for example, 22064232 + ... + 22066512.
It is an arithmetic number, because the mean of its divisors is an integer number (478891392).
Almost surely, 250331113532 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 50331113532, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (80453753856).
50331113532 is an abundant number, since it is smaller than the sum of its proper divisors (110576394180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50331113532 is a wasteful number, since it uses less digits than its factorization.
50331113532 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2380 (or 2363 counting only the distinct ones).
The product of its (nonzero) digits is 4050, while the sum is 27.
Adding to 50331113532 its reverse (23531113305), we get a palindrome (73862226837).
The spelling of 50331113532 in words is "fifty billion, three hundred thirty-one million, one hundred thirteen thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •