Base | Representation |
---|---|
bin | 10110111110000011010110… |
… | …00001101100001001100010 |
3 | 20121211202201022211221020110 |
4 | 23133001223001230021202 |
5 | 23110031212404143200 |
6 | 255232130535152150 |
7 | 13432162012361256 |
oct | 1337015301541142 |
9 | 217752638757213 |
10 | 50510611006050 |
11 | 15104480116478 |
12 | 57b9365515656 |
13 | 222519000b550 |
14 | c68a25ba0266 |
15 | 5c8d6c0e4b50 |
hex | 2df06b06c262 |
50510611006050 has 96 divisors (see below), whose sum is σ = 137188663738560. Its totient is φ = 12222645868800.
The previous prime is 50510611006027. The next prime is 50510611006099. The reversal of 50510611006050 is 5060011601505.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 50510611005999 and 50510611006017.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 219400861 + ... + 219630960.
It is an arithmetic number, because the mean of its divisors is an integer number (1429048580610).
Almost surely, 250510611006050 is an apocalyptic number.
50510611006050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50510611006050 is an abundant number, since it is smaller than the sum of its proper divisors (86678052732510).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50510611006050 is a wasteful number, since it uses less digits than its factorization.
50510611006050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 439031908 (or 439031903 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 30.
Adding to 50510611006050 its reverse (5060011601505), we get a palindrome (55570622607555).
The spelling of 50510611006050 in words is "fifty trillion, five hundred ten billion, six hundred eleven million, six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •