Base | Representation |
---|---|
bin | 1100000001001… |
… | …1001111001001 |
3 | 10111212010010101 |
4 | 3000103033021 |
5 | 100401113231 |
6 | 5000245401 |
7 | 1151324134 |
oct | 300231711 |
9 | 114763111 |
10 | 50410441 |
11 | 26501124 |
12 | 14a70861 |
13 | a5a0183 |
14 | 69a321b |
15 | 465b661 |
hex | 30133c9 |
50410441 has 4 divisors (see below), whose sum is σ = 50457492. Its totient is φ = 50363392.
The previous prime is 50410427. The next prime is 50410447. The reversal of 50410441 is 14401405.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 14401405 = 5 ⋅2880281.
It can be written as a sum of positive squares in 2 ways, for example, as 14470416 + 35940025 = 3804^2 + 5995^2 .
It is a cyclic number.
It is not a de Polignac number, because 50410441 - 215 = 50377673 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50410447) 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, 21880 + ... + 24073.
It is an arithmetic number, because the mean of its divisors is an integer number (12614373).
Almost surely, 250410441 is an apocalyptic number.
It is an amenable number.
50410441 is a deficient number, since it is larger than the sum of its proper divisors (47051).
50410441 is a wasteful number, since it uses less digits than its factorization.
50410441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 47050.
The product of its (nonzero) digits is 320, while the sum is 19.
The square root of 50410441 is about 7100.0310562701. The cubic root of 50410441 is about 369.4084557846.
Adding to 50410441 its reverse (14401405), we get a palindrome (64811846).
The spelling of 50410441 in words is "fifty million, four hundred ten thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •