Base | Representation |
---|---|
bin | 1011111100100… |
… | …1111111100001 |
3 | 10111021212120222 |
4 | 2333021333201 |
5 | 100312013213 |
6 | 4550012425 |
7 | 1145634362 |
oct | 277117741 |
9 | 114255528 |
10 | 50110433 |
11 | 2631678a |
12 | 14947115 |
13 | a4c6759 |
14 | 6925b69 |
15 | 45ec808 |
hex | 2fc9fe1 |
50110433 has 2 divisors, whose sum is σ = 50110434. Its totient is φ = 50110432.
The previous prime is 50110363. The next prime is 50110447. The reversal of 50110433 is 33401105.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34492129 + 15618304 = 5873^2 + 3952^2 .
It is a cyclic number.
It is not a de Polignac number, because 50110433 - 212 = 50106337 is a prime.
It is a super-2 number, since 2×501104332 = 5022110990894978, which contains 22 as substring.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (50110453) 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 as a sum of consecutive naturals, namely, 25055216 + 25055217.
It is an arithmetic number, because the mean of its divisors is an integer number (25055217).
Almost surely, 250110433 is an apocalyptic number.
It is an amenable number.
50110433 is a deficient number, since it is larger than the sum of its proper divisors (1).
50110433 is an equidigital number, since it uses as much as digits as its factorization.
50110433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 50110433 is about 7078.8722971954. The cubic root of 50110433 is about 368.6741761939.
Adding to 50110433 its reverse (33401105), we get a palindrome (83511538).
The spelling of 50110433 in words is "fifty million, one hundred ten thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •