Base | Representation |
---|---|
bin | 1011111100001… |
… | …0111010010101 |
3 | 10111020101210202 |
4 | 2333002322111 |
5 | 100310101204 |
6 | 4545230245 |
7 | 1145453666 |
oct | 277027225 |
9 | 114211722 |
10 | 50081429 |
11 | 262a6a12 |
12 | 14932385 |
13 | a4b64a8 |
14 | 691936d |
15 | 45e3e1e |
hex | 2fc2e95 |
50081429 has 4 divisors (see below), whose sum is σ = 50095584. Its totient is φ = 50067276.
The previous prime is 50081417. The next prime is 50081441. The reversal of 50081429 is 92418005.
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, and also an emirpimes, since its reverse is a distinct semiprime: 92418005 = 5 ⋅18483601.
It is an interprime number because it is at equal distance from previous prime (50081417) and next prime (50081441).
It is a cyclic number.
It is not a de Polignac number, because 50081429 - 212 = 50077333 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 (50081489) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3464 + ... + 10590.
It is an arithmetic number, because the mean of its divisors is an integer number (12523896).
Almost surely, 250081429 is an apocalyptic number.
It is an amenable number.
50081429 is a deficient number, since it is larger than the sum of its proper divisors (14155).
50081429 is an equidigital number, since it uses as much as digits as its factorization.
50081429 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14154.
The product of its (nonzero) digits is 2880, while the sum is 29.
The square root of 50081429 is about 7076.8233692809. The cubic root of 50081429 is about 368.6030327288.
The spelling of 50081429 in words is "fifty million, eighty-one thousand, four hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •