Base | Representation |
---|---|
bin | 101110111001111000… |
… | …000100000111000001 |
3 | 11210222220002200112000 |
4 | 232321320010013001 |
5 | 1311120424401423 |
6 | 35045252254213 |
7 | 3432021321543 |
oct | 567170040701 |
9 | 153886080460 |
10 | 50363122113 |
11 | 1a3a4740077 |
12 | 9916611369 |
13 | 499806b895 |
14 | 261aa55693 |
15 | 149b6c1843 |
hex | bb9e041c1 |
50363122113 has 8 divisors (see below), whose sum is σ = 74612032800. Its totient is φ = 33575414724.
The previous prime is 50363122099. The next prime is 50363122123. The reversal of 50363122113 is 31122136305.
50363122113 is a `hidden beast` number, since 5 + 0 + 3 + 631 + 2 + 21 + 1 + 3 = 666.
It is not a de Polignac number, because 50363122113 - 24 = 50363122097 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1865300819 = 50363122113 / (5 + 0 + 3 + 6 + 3 + 1 + 2 + 2 + 1 + 1 + 3).
It is not an unprimeable number, because it can be changed into a prime (50363122123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 932650383 + ... + 932650436.
It is an arithmetic number, because the mean of its divisors is an integer number (9326504100).
Almost surely, 250363122113 is an apocalyptic number.
It is an amenable number.
50363122113 is a deficient number, since it is larger than the sum of its proper divisors (24248910687).
50363122113 is a wasteful number, since it uses less digits than its factorization.
50363122113 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1865300828 (or 1865300822 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 27.
Adding to 50363122113 its reverse (31122136305), we get a palindrome (81485258418).
The spelling of 50363122113 in words is "fifty billion, three hundred sixty-three million, one hundred twenty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •