Base | Representation |
---|---|
bin | 101110110011110001… |
… | …001011100000000000 |
3 | 11210201202021202210200 |
4 | 232303301023200000 |
5 | 1310413211412310 |
6 | 35031152125200 |
7 | 3426335340120 |
oct | 566361134000 |
9 | 153652252720 |
10 | 50260654080 |
11 | 1a35191334a |
12 | 98a8236800 |
13 | 497ca72900 |
14 | 260b1c0c80 |
15 | 14926d09c0 |
hex | bb3c4b800 |
50260654080 has 864 divisors, whose sum is σ = 216038702880. Its totient is φ = 10581442560.
The previous prime is 50260654063. The next prime is 50260654091. The reversal of 50260654080 is 8045606205.
50260654080 is a `hidden beast` number, since 5 + 0 + 2 + 606 + 5 + 40 + 8 + 0 = 666.
It is a super-2 number, since 2×502606540802 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 109025050 + ... + 109025510.
It is an arithmetic number, because the mean of its divisors is an integer number (250044795).
Almost surely, 250260654080 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 50260654080, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108019351440).
50260654080 is an abundant number, since it is smaller than the sum of its proper divisors (165778048800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50260654080 is a wasteful number, since it uses less digits than its factorization.
50260654080 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 527 (or 491 counting only the distinct ones).
The product of its (nonzero) digits is 57600, while the sum is 36.
The spelling of 50260654080 in words is "fifty billion, two hundred sixty million, six hundred fifty-four thousand, eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •