Base | Representation |
---|---|
bin | 1100000001001… |
… | …1001000101111 |
3 | 10111212002120012 |
4 | 3000103020233 |
5 | 100401110111 |
6 | 5000243435 |
7 | 1151323010 |
oct | 300231057 |
9 | 114762505 |
10 | 50410031 |
11 | 26500891 |
12 | 14a7057b |
13 | a59cc29 |
14 | 69a3007 |
15 | 465b48b |
hex | 301322f |
50410031 has 8 divisors (see below), whose sum is σ = 57979680. Its totient is φ = 42932448.
The previous prime is 50410007. The next prime is 50410039. The reversal of 50410031 is 13001405.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-50410031 is a prime.
It is a super-2 number, since 2×504100312 = 5082342450841922, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50409988 and 50410015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50410039) 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 7 ways as a sum of consecutive naturals, for example, 21836 + ... + 24033.
It is an arithmetic number, because the mean of its divisors is an integer number (7247460).
Almost surely, 250410031 is an apocalyptic number.
50410031 is a deficient number, since it is larger than the sum of its proper divisors (7569649).
50410031 is a wasteful number, since it uses less digits than its factorization.
50410031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 46033.
The product of its (nonzero) digits is 60, while the sum is 14.
The square root of 50410031 is about 7100.0021830983. The cubic root of 50410031 is about 369.4074542865.
Adding to 50410031 its reverse (13001405), we get a palindrome (63411436).
The spelling of 50410031 in words is "fifty million, four hundred ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •