Base | Representation |
---|---|
bin | 101111001001011111… |
… | …011101001011100110 |
3 | 11211200011001212202110 |
4 | 233021133131023212 |
5 | 1312140011403122 |
6 | 35131251421450 |
7 | 3441352210104 |
oct | 571137351346 |
9 | 154604055673 |
10 | 50625106662 |
11 | 1a519609a29 |
12 | 998a2b4886 |
13 | 4a0a419220 |
14 | 2643770c74 |
15 | 14b46c190c |
hex | bc97dd2e6 |
50625106662 has 256 divisors, whose sum is σ = 124325591040. Its totient is φ = 13587222528.
The previous prime is 50625106619. The next prime is 50625106673. The reversal of 50625106662 is 26660152605.
It is a happy number.
It is a super-3 number, since 3×506251066623 (a number of 33 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 50625106662.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 172781788 + ... + 172782080.
It is an arithmetic number, because the mean of its divisors is an integer number (485646840).
Almost surely, 250625106662 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50625106662, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62162795520).
50625106662 is an abundant number, since it is smaller than the sum of its proper divisors (73700484378).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50625106662 is a wasteful number, since it uses less digits than its factorization.
50625106662 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 527.
The product of its (nonzero) digits is 129600, while the sum is 39.
The spelling of 50625106662 in words is "fifty billion, six hundred twenty-five million, one hundred six thousand, six hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •