Base | Representation |
---|---|
bin | 1100000100011… |
… | …1111101111111 |
3 | 10112021002102000 |
4 | 3001013331333 |
5 | 100430021211 |
6 | 5005033343 |
7 | 1153213632 |
oct | 301077577 |
9 | 115232360 |
10 | 50626431 |
11 | 26639429 |
12 | 14b55853 |
13 | a64758b |
14 | 6a1bc19 |
15 | 46a0656 |
hex | 3047f7f |
50626431 has 64 divisors (see below), whose sum is σ = 84672000. Its totient is φ = 29756160.
The previous prime is 50626417. The next prime is 50626453. The reversal of 50626431 is 13462605.
50626431 is a `hidden beast` number, since 5 + 0 + 626 + 4 + 31 = 666.
It is not a de Polignac number, because 50626431 - 25 = 50626399 is a prime.
It is a super-2 number, since 2×506264312 = 5126071031595522, which contains 22 as substring.
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 = 50626395 and 50626404.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50626481) 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 in 63 ways as a sum of consecutive naturals, for example, 609916 + ... + 609998.
It is an arithmetic number, because the mean of its divisors is an integer number (1323000).
Almost surely, 250626431 is an apocalyptic number.
50626431 is a deficient number, since it is larger than the sum of its proper divisors (34045569).
50626431 is a wasteful number, since it uses less digits than its factorization.
50626431 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 181 (or 175 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 50626431 is about 7115.2252950978. The cubic root of 50626431 is about 369.9352966965.
The spelling of 50626431 in words is "fifty million, six hundred twenty-six thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •