Base | Representation |
---|---|
bin | 101110110011110001… |
… | …101101101100111000 |
3 | 11210201202112212222010 |
4 | 232303301231230320 |
5 | 1310413230403133 |
6 | 35031155125520 |
7 | 3426336462414 |
oct | 566361555470 |
9 | 153652485863 |
10 | 50260794168 |
11 | 1a3519a9622 |
12 | 98a82a38a0 |
13 | 497cac15c0 |
14 | 260b219d44 |
15 | 149270c263 |
hex | bb3c6db38 |
50260794168 has 128 divisors (see below), whose sum is σ = 143569843200. Its totient is φ = 14525454336.
The previous prime is 50260794161. The next prime is 50260794173. The reversal of 50260794168 is 86149706205.
It is a super-3 number, since 3×502607941683 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50260794161) 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, 2658493 + ... + 2677331.
It is an arithmetic number, because the mean of its divisors is an integer number (1121639400).
Almost surely, 250260794168 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 50260794168, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71784921600).
50260794168 is an abundant number, since it is smaller than the sum of its proper divisors (93309049032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50260794168 is a wasteful number, since it uses less digits than its factorization.
50260794168 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19381 (or 19377 counting only the distinct ones).
The product of its (nonzero) digits is 725760, while the sum is 48.
The spelling of 50260794168 in words is "fifty billion, two hundred sixty million, seven hundred ninety-four thousand, one hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •