Base | Representation |
---|---|
bin | 1100000100110… |
… | …0110110100001 |
3 | 10112022002211211 |
4 | 3001030312201 |
5 | 100431141213 |
6 | 5005310121 |
7 | 1153326145 |
oct | 301146641 |
9 | 115262754 |
10 | 50646433 |
11 | 26652462 |
12 | 14b65341 |
13 | a653706 |
14 | 6a25225 |
15 | 46a653d |
hex | 304cda1 |
50646433 has 2 divisors, whose sum is σ = 50646434. Its totient is φ = 50646432.
The previous prime is 50646413. The next prime is 50646443. The reversal of 50646433 is 33464605.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 38093584 + 12552849 = 6172^2 + 3543^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50646433 is a prime.
It is a super-2 number, since 2×506464332 = 5130122351246978, which contains 22 as substring.
It is equal to p3037576 and since 50646433 and 3037576 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 50646395 and 50646404.
It is not a weakly prime, because it can be changed into another prime (50646413) 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, 25323216 + 25323217.
It is an arithmetic number, because the mean of its divisors is an integer number (25323217).
Almost surely, 250646433 is an apocalyptic number.
It is an amenable number.
50646433 is a deficient number, since it is larger than the sum of its proper divisors (1).
50646433 is an equidigital number, since it uses as much as digits as its factorization.
50646433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25920, while the sum is 31.
The square root of 50646433 is about 7116.6307337110. The cubic root of 50646433 is about 369.9840095354.
The spelling of 50646433 in words is "fifty million, six hundred forty-six thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •