Base | Representation |
---|---|
bin | 1100000100010… |
… | …1100001011101 |
3 | 10112020120122222 |
4 | 3001011201131 |
5 | 100424211123 |
6 | 5004515125 |
7 | 1153142501 |
oct | 301054135 |
9 | 115216588 |
10 | 50616413 |
11 | 26631951 |
12 | 14b4baa5 |
13 | a642b53 |
14 | 6a18301 |
15 | 469c6c8 |
hex | 304585d |
50616413 has 4 divisors (see below), whose sum is σ = 50630688. Its totient is φ = 50602140.
The previous prime is 50616403. The next prime is 50616451. The reversal of 50616413 is 31461605.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also a brilliant number, because the two primes have the same length.
It is a cyclic number.
It is not a de Polignac number, because 50616413 - 222 = 46422109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50616403) 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 3 ways as a sum of consecutive naturals, for example, 2720 + ... + 10422.
It is an arithmetic number, because the mean of its divisors is an integer number (12657672).
Almost surely, 250616413 is an apocalyptic number.
It is an amenable number.
50616413 is a deficient number, since it is larger than the sum of its proper divisors (14275).
50616413 is an equidigital number, since it uses as much as digits as its factorization.
50616413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14274.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 50616413 is about 7114.5212769378. The cubic root of 50616413 is about 369.9108940527.
The spelling of 50616413 in words is "fifty million, six hundred sixteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •