Base | Representation |
---|---|
bin | 1100000010110… |
… | …0110111010101 |
3 | 10112001110010020 |
4 | 3000230313111 |
5 | 100412443123 |
6 | 5002415353 |
7 | 1152242154 |
oct | 300546725 |
9 | 115043106 |
10 | 50515413 |
11 | 26572a83 |
12 | 14b01559 |
13 | a608ba0 |
14 | 69cd59b |
15 | 467c7e3 |
hex | 302cdd5 |
50515413 has 16 divisors (see below), whose sum is σ = 73906560. Its totient is φ = 30498624.
The previous prime is 50515391. The next prime is 50515417. The reversal of 50515413 is 31451505.
50515413 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 50515413 - 26 = 50515349 is a prime.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50515417) 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 15 ways as a sum of consecutive naturals, for example, 10153 + ... + 14286.
It is an arithmetic number, because the mean of its divisors is an integer number (4619160).
Almost surely, 250515413 is an apocalyptic number.
50515413 is a gapful number since it is divisible by the number (53) formed by its first and last digit.
It is an amenable number.
50515413 is a deficient number, since it is larger than the sum of its proper divisors (23391147).
50515413 is a wasteful number, since it uses less digits than its factorization.
50515413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24508.
The product of its (nonzero) digits is 1500, while the sum is 24.
The square root of 50515413 is about 7107.4195739382. The cubic root of 50515413 is about 369.6646901324.
Adding to 50515413 its reverse (31451505), we get a palindrome (81966918).
The spelling of 50515413 in words is "fifty million, five hundred fifteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •