Base | Representation |
---|---|
bin | 1100000110010… |
… | …0101101101011 |
3 | 10112111001220202 |
4 | 3001210231223 |
5 | 100442303141 |
6 | 5011342415 |
7 | 1154214122 |
oct | 301445553 |
9 | 115431822 |
10 | 50744171 |
11 | 26709935 |
12 | 14bb1a0b |
13 | a68904a |
14 | 6a4cab9 |
15 | 46c549b |
hex | 3064b6b |
50744171 has 8 divisors (see below), whose sum is σ = 53716080. Its totient is φ = 47853792.
The previous prime is 50744153. The next prime is 50744203. The reversal of 50744171 is 17144705.
50744171 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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-50744171 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (29).
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50744471) 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 7 ways as a sum of consecutive naturals, for example, 19100 + ... + 21593.
It is an arithmetic number, because the mean of its divisors is an integer number (6714510).
Almost surely, 250744171 is an apocalyptic number.
50744171 is a deficient number, since it is larger than the sum of its proper divisors (2971909).
50744171 is a wasteful number, since it uses less digits than its factorization.
50744171 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40765.
The product of its (nonzero) digits is 3920, while the sum is 29.
The square root of 50744171 is about 7123.4942970427. The cubic root of 50744171 is about 370.2218562325.
Adding to 50744171 its reverse (17144705), we get a palindrome (67888876).
The spelling of 50744171 in words is "fifty million, seven hundred forty-four thousand, one hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •