Base | Representation |
---|---|
bin | 1100000111110… |
… | …0001101110001 |
3 | 10112122221222000 |
4 | 3001330031301 |
5 | 101003343213 |
6 | 5013404213 |
7 | 1155064560 |
oct | 301741561 |
9 | 115587860 |
10 | 50840433 |
11 | 26775196 |
12 | 15039669 |
13 | a6c0ac7 |
14 | 6a75bd7 |
15 | 46e3c73 |
hex | 307c371 |
50840433 has 16 divisors (see below), whose sum is σ = 86079360. Its totient is φ = 29051568.
The previous prime is 50840431. The next prime is 50840437. The reversal of 50840433 is 33404805.
It is a happy number.
50840433 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50840433 - 21 = 50840431 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 50840397 and 50840406.
It is not an unprimeable number, because it can be changed into a prime (50840431) 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 15 ways as a sum of consecutive naturals, for example, 134310 + ... + 134687.
It is an arithmetic number, because the mean of its divisors is an integer number (5379960).
Almost surely, 250840433 is an apocalyptic number.
It is an amenable number.
50840433 is a deficient number, since it is larger than the sum of its proper divisors (35238927).
50840433 is a wasteful number, since it uses less digits than its factorization.
50840433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 269013 (or 269007 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 27.
The square root of 50840433 is about 7130.2477516563. The cubic root of 50840433 is about 370.4558127243.
The spelling of 50840433 in words is "fifty million, eight hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •