Base | Representation |
---|---|
bin | 1100000000101… |
… | …0011001110101 |
3 | 10111210021111101 |
4 | 3000022121311 |
5 | 100343434021 |
6 | 4555410101 |
7 | 1151113510 |
oct | 300123165 |
9 | 114707441 |
10 | 50374261 |
11 | 26486a23 |
12 | 14a53931 |
13 | a589872 |
14 | 6993d77 |
15 | 4650a91 |
hex | 300a675 |
50374261 has 4 divisors (see below), whose sum is σ = 57570592. Its totient is φ = 43177932.
The previous prime is 50374253. The next prime is 50374273. The reversal of 50374261 is 16247305.
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 an emirpimes, since its reverse is a distinct semiprime: 16247305 = 5 ⋅3249461.
It is not a de Polignac number, because 50374261 - 23 = 50374253 is a prime.
It is a super-2 number, since 2×503742612 = 5075132342592242, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50374201) 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, 3598155 + ... + 3598168.
It is an arithmetic number, because the mean of its divisors is an integer number (14392648).
Almost surely, 250374261 is an apocalyptic number.
It is an amenable number.
50374261 is a deficient number, since it is larger than the sum of its proper divisors (7196331).
50374261 is an equidigital number, since it uses as much as digits as its factorization.
50374261 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7196330.
The product of its (nonzero) digits is 5040, while the sum is 28.
The square root of 50374261 is about 7097.4827227687. The cubic root of 50374261 is about 369.3200587754.
The spelling of 50374261 in words is "fifty million, three hundred seventy-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •