Base | Representation |
---|---|
bin | 1011111100101… |
… | …0101100111101 |
3 | 10111022000120200 |
4 | 2333022230331 |
5 | 100312111331 |
6 | 4550034113 |
7 | 1145646015 |
oct | 277125475 |
9 | 114260520 |
10 | 50113341 |
11 | 26318993 |
12 | 14948939 |
13 | a4c7b85 |
14 | 6926c45 |
15 | 45ed5e6 |
hex | 2fcab3d |
50113341 has 6 divisors (see below), whose sum is σ = 72385950. Its totient is φ = 33408888.
The previous prime is 50113321. The next prime is 50113351. The reversal of 50113341 is 14331105.
It can be written as a sum of positive squares in only one way, i.e., 25462116 + 24651225 = 5046^2 + 4965^2 .
It is not a de Polignac number, because 50113341 - 26 = 50113277 is a prime.
It is a super-2 number, since 2×501133412 = 5022693892364562, which contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50113321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 2784066 + ... + 2784083.
It is an arithmetic number, because the mean of its divisors is an integer number (12064325).
Almost surely, 250113341 is an apocalyptic number.
It is an amenable number.
50113341 is a deficient number, since it is larger than the sum of its proper divisors (22272609).
50113341 is a wasteful number, since it uses less digits than its factorization.
50113341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5568155 (or 5568152 counting only the distinct ones).
The product of its (nonzero) digits is 180, while the sum is 18.
The square root of 50113341 is about 7079.0776941633. The cubic root of 50113341 is about 368.6813076680.
Adding to 50113341 its reverse (14331105), we get a palindrome (64444446).
The spelling of 50113341 in words is "fifty million, one hundred thirteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •