Base | Representation |
---|---|
bin | 1100001010000… |
… | …1110111010101 |
3 | 10112221210111120 |
4 | 3002201313111 |
5 | 101023312040 |
6 | 5020554153 |
7 | 1156306302 |
oct | 302416725 |
9 | 115853446 |
10 | 50994645 |
11 | 26870039 |
12 | 150b2959 |
13 | a746060 |
14 | 6ab60a9 |
15 | 47247d0 |
hex | 30a1dd5 |
50994645 has 32 divisors (see below), whose sum is σ = 93042432. Its totient is φ = 23626752.
The previous prime is 50994641. The next prime is 50994649. The reversal of 50994645 is 54649905.
It is a happy number.
50994645 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (50994641) and next prime (50994649).
It is not a de Polignac number, because 50994645 - 22 = 50994641 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 50994597 and 50994606.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50994641) 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 31 ways as a sum of consecutive naturals, for example, 4377 + ... + 11006.
It is an arithmetic number, because the mean of its divisors is an integer number (2907576).
Almost surely, 250994645 is an apocalyptic number.
It is an amenable number.
50994645 is a deficient number, since it is larger than the sum of its proper divisors (42047787).
50994645 is a wasteful number, since it uses less digits than its factorization.
50994645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15421.
The product of its (nonzero) digits is 194400, while the sum is 42.
The square root of 50994645 is about 7141.0534937081. The cubic root of 50994645 is about 370.8299969681.
The spelling of 50994645 in words is "fifty million, nine hundred ninety-four thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •