Base | Representation |
---|---|
bin | 1011111110111… |
… | …1100001010110 |
3 | 10111120200110012 |
4 | 2333233201112 |
5 | 100331423100 |
6 | 4553200222 |
7 | 1150144466 |
oct | 277574126 |
9 | 114520405 |
10 | 50264150 |
11 | 26411222 |
12 | 14a00072 |
13 | a54b701 |
14 | 6965ba6 |
15 | 462d135 |
hex | 2fef856 |
50264150 has 48 divisors (see below), whose sum is σ = 97118784. Its totient is φ = 19342080.
The previous prime is 50264141. The next prime is 50264153. The reversal of 50264150 is 5146205.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50264153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 171404 + ... + 171696.
It is an arithmetic number, because the mean of its divisors is an integer number (2023308).
Almost surely, 250264150 is an apocalyptic number.
50264150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50264150 is a deficient number, since it is larger than the sum of its proper divisors (46854634).
50264150 is a wasteful number, since it uses less digits than its factorization.
50264150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 425 (or 420 counting only the distinct ones).
The product of its (nonzero) digits is 1200, while the sum is 23.
The square root of 50264150 is about 7089.7214331735. The cubic root of 50264150 is about 369.0507686896.
The spelling of 50264150 in words is "fifty million, two hundred sixty-four thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •