Base | Representation |
---|---|
bin | 10111000100001010000000… |
… | …01111001110111001100000 |
3 | 20122120211002011020122200120 |
4 | 23202011000033032321200 |
5 | 23122000232203032342 |
6 | 255512334443320240 |
7 | 13453265320060200 |
oct | 1342050017167140 |
9 | 218524064218616 |
10 | 50720346533472 |
11 | 15185418383500 |
12 | 5831b39520080 |
13 | 223bba62a8c25 |
14 | c74c40c3c400 |
15 | 5ce5450d4aec |
hex | 2e21403cee60 |
50720346533472 has 432 divisors, whose sum is σ = 171282740965056. Its totient is φ = 13093269235200.
The previous prime is 50720346533443. The next prime is 50720346533489. The reversal of 50720346533472 is 27433564302705.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 92503647 + ... + 93050337.
It is an arithmetic number, because the mean of its divisors is an integer number (396487826308).
Almost surely, 250720346533472 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 50720346533472, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85641370482528).
50720346533472 is an abundant number, since it is smaller than the sum of its proper divisors (120562394431584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50720346533472 is a wasteful number, since it uses less digits than its factorization.
50720346533472 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 546903 (or 546877 counting only the distinct ones).
The product of its (nonzero) digits is 12700800, while the sum is 51.
The spelling of 50720346533472 in words is "fifty trillion, seven hundred twenty billion, three hundred forty-six million, five hundred thirty-three thousand, four hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •