Base | Representation |
---|---|
bin | 101111001010001100… |
… | …100110010011000000 |
3 | 11211200222100002201000 |
4 | 233022030212103000 |
5 | 1312201024043410 |
6 | 35132353212000 |
7 | 3441554615040 |
oct | 571214462300 |
9 | 154628302630 |
10 | 50636940480 |
11 | 1a525261945 |
12 | 9992261000 |
13 | 4a0ca00699 |
14 | 2645171720 |
15 | 14b575cdc0 |
hex | bca3264c0 |
50636940480 has 448 divisors, whose sum is σ = 204825600000. Its totient is φ = 11536183296.
The previous prime is 50636940449. The next prime is 50636940493. The reversal of 50636940480 is 8404963605.
50636940480 is a `hidden beast` number, since 5 + 0 + 636 + 9 + 4 + 0 + 4 + 8 + 0 = 666.
It is a tau number, because it is divible by the number of its divisors (448).
It is a Harshad number since it is a multiple of its sum of digits (45).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 21106321 + ... + 21108719.
It is an arithmetic number, because the mean of its divisors is an integer number (457200000).
Almost surely, 250636940480 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 50636940480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (102412800000).
50636940480 is an abundant number, since it is smaller than the sum of its proper divisors (154188659520).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50636940480 is a wasteful number, since it uses less digits than its factorization.
50636940480 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2781 (or 2765 counting only the distinct ones).
The product of its (nonzero) digits is 622080, while the sum is 45.
The spelling of 50636940480 in words is "fifty billion, six hundred thirty-six million, nine hundred forty thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •