Base | Representation |
---|---|
bin | 1100000000110… |
… | …1010110010101 |
3 | 10111210220001012 |
4 | 3000031112111 |
5 | 100344330300 |
6 | 4555542005 |
7 | 1151163623 |
oct | 300152625 |
9 | 114726035 |
10 | 50386325 |
11 | 26494aa0 |
12 | 14a5a905 |
13 | a5921c2 |
14 | 6998513 |
15 | 4654435 |
hex | 300d595 |
50386325 has 24 divisors (see below), whose sum is σ = 69760416. Its totient is φ = 35784000.
The previous prime is 50386321. The next prime is 50386339. The reversal of 50386325 is 52368305.
It is not a de Polignac number, because 50386325 - 22 = 50386321 is a prime.
It is a Smith number, since the sum of its digits (32) coincides with the sum of the digits of its prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 50386291 and 50386300.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50386321) 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 in 23 ways as a sum of consecutive naturals, for example, 9695 + ... + 13955.
It is an arithmetic number, because the mean of its divisors is an integer number (2906684).
Almost surely, 250386325 is an apocalyptic number.
50386325 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50386325 is a deficient number, since it is larger than the sum of its proper divisors (19374091).
50386325 is a wasteful number, since it uses less digits than its factorization.
50386325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4325 (or 4320 counting only the distinct ones).
The product of its (nonzero) digits is 21600, while the sum is 32.
The square root of 50386325 is about 7098.3325506770. The cubic root of 50386325 is about 369.3495389205.
The spelling of 50386325 in words is "fifty million, three hundred eighty-six thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •