Base | Representation |
---|---|
bin | 101111011110110000… |
… | …111110101111111001 |
3 | 11212121000200001202010 |
4 | 233132300332233321 |
5 | 1313402344202022 |
6 | 35230521400133 |
7 | 3453245016024 |
oct | 573660765771 |
9 | 155530601663 |
10 | 50982022137 |
11 | 1a6920278a2 |
12 | 9a69939049 |
13 | 4a66354007 |
14 | 2678d1c1bb |
15 | 14d5bc450c |
hex | bdec3ebf9 |
50982022137 has 16 divisors (see below), whose sum is σ = 71629830720. Its totient is φ = 32164920000.
The previous prime is 50982022123. The next prime is 50982022141. The reversal of 50982022137 is 73122028905.
It is not a de Polignac number, because 50982022137 - 27 = 50982022009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50982022095 and 50982022104.
It is not an unprimeable number, because it can be changed into a prime (50982023137) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 421614 + ... + 528887.
It is an arithmetic number, because the mean of its divisors is an integer number (4476864420).
Almost surely, 250982022137 is an apocalyptic number.
50982022137 is a gapful number since it is divisible by the number (57) formed by its first and last digit.
It is an amenable number.
50982022137 is a deficient number, since it is larger than the sum of its proper divisors (20647808583).
50982022137 is a wasteful number, since it uses less digits than its factorization.
50982022137 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 951464.
The product of its (nonzero) digits is 60480, while the sum is 39.
The spelling of 50982022137 in words is "fifty billion, nine hundred eighty-two million, twenty-two thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •