Base | Representation |
---|---|
bin | 1011111101000… |
… | …0010100010110 |
3 | 10111100012010120 |
4 | 2333100110112 |
5 | 100313330332 |
6 | 4550332410 |
7 | 1146103044 |
oct | 277202426 |
9 | 114305116 |
10 | 50136342 |
11 | 263341a3 |
12 | 1495a106 |
13 | a505499 |
14 | 6931394 |
15 | 460532c |
hex | 2fd0516 |
50136342 has 8 divisors (see below), whose sum is σ = 100272696. Its totient is φ = 16712112.
The previous prime is 50136341. The next prime is 50136353. The reversal of 50136342 is 24363105.
It is a happy number.
50136342 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
50136342 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50136341) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4178023 + ... + 4178034.
It is an arithmetic number, because the mean of its divisors is an integer number (12534087).
Almost surely, 250136342 is an apocalyptic number.
50136342 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50136342 is a wasteful number, since it uses less digits than its factorization.
50136342 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8356062.
The product of its (nonzero) digits is 2160, while the sum is 24.
The square root of 50136342 is about 7080.7020838332. The cubic root of 50136342 is about 368.7377047705.
Adding to 50136342 its reverse (24363105), we get a palindrome (74499447).
The spelling of 50136342 in words is "fifty million, one hundred thirty-six thousand, three hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •