Base | Representation |
---|---|
bin | 1100000000111… |
… | …0000110111001 |
3 | 10111211001022022 |
4 | 3000032012321 |
5 | 100344430213 |
6 | 5000004225 |
7 | 1151205653 |
oct | 300160671 |
9 | 114731268 |
10 | 50389433 |
11 | 26497366 |
12 | 14a60675 |
13 | a593743 |
14 | 69996d3 |
15 | 4655308 |
hex | 300e1b9 |
50389433 has 2 divisors, whose sum is σ = 50389434. Its totient is φ = 50389432.
The previous prime is 50389399. The next prime is 50389441. The reversal of 50389433 is 33498305.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 27426169 + 22963264 = 5237^2 + 4792^2 .
It is a cyclic number.
It is not a de Polignac number, because 50389433 - 28 = 50389177 is a prime.
It is a super-2 number, since 2×503894332 = 5078189916122978, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50389393 and 50389402.
It is not a weakly prime, because it can be changed into another prime (50389033) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 25194716 + 25194717.
It is an arithmetic number, because the mean of its divisors is an integer number (25194717).
Almost surely, 250389433 is an apocalyptic number.
It is an amenable number.
50389433 is a deficient number, since it is larger than the sum of its proper divisors (1).
50389433 is an equidigital number, since it uses as much as digits as its factorization.
50389433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38880, while the sum is 35.
The square root of 50389433 is about 7098.5514719554. The cubic root of 50389433 is about 369.3571330098.
The spelling of 50389433 in words is "fifty million, three hundred eighty-nine thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •