Base | Representation |
---|---|
bin | 10110110000111100111100… |
… | …10100111000110011100000 |
3 | 20120020201220022210022121102 |
4 | 23120132132110320303200 |
5 | 23030142401012014220 |
6 | 254245250512413532 |
7 | 13354515601033112 |
oct | 1330363624706340 |
9 | 216221808708542 |
10 | 50060500110560 |
11 | 14a505a2268665 |
12 | 57460882472a8 |
13 | 21c18b9973674 |
14 | c50d266813b2 |
15 | 5bc2c624d775 |
hex | 2d879e538ce0 |
50060500110560 has 96 divisors (see below), whose sum is σ = 118509916492800. Its totient is φ = 19983235502080.
The previous prime is 50060500110529. The next prime is 50060500110571. The reversal of 50060500110560 is 6501100506005.
50060500110560 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1785883745 + ... + 1785911775.
It is an arithmetic number, because the mean of its divisors is an integer number (1234478296800).
Almost surely, 250060500110560 is an apocalyptic number.
It is an amenable number.
50060500110560 is an abundant number, since it is smaller than the sum of its proper divisors (68449416382240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50060500110560 is a wasteful number, since it uses less digits than its factorization.
50060500110560 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50484 (or 50476 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 50060500110560 its reverse (6501100506005), we get a palindrome (56561600616565).
The spelling of 50060500110560 in words is "fifty trillion, sixty billion, five hundred million, one hundred ten thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •