Base | Representation |
---|---|
bin | 1011111011110… |
… | …1110011111010 |
3 | 10111012100011000 |
4 | 2332331303322 |
5 | 100303414123 |
6 | 4544545430 |
7 | 1145336043 |
oct | 276756372 |
9 | 114170130 |
10 | 50060538 |
11 | 26292250 |
12 | 14922276 |
13 | a4a9b28 |
14 | 69118ca |
15 | 45dcb43 |
hex | 2fbdcfa |
50060538 has 64 divisors (see below), whose sum is σ = 123171840. Its totient is φ = 14943600.
The previous prime is 50060531. The next prime is 50060561. The reversal of 50060538 is 83506005.
50060538 is a `hidden beast` number, since 50 + 0 + 605 + 3 + 8 = 666.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is not an unprimeable number, because it can be changed into a prime (50060531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 41581 + ... + 42767.
It is an arithmetic number, because the mean of its divisors is an integer number (1924560).
Almost surely, 250060538 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50060538, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61585920).
50060538 is an abundant number, since it is smaller than the sum of its proper divisors (73111302).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50060538 is a wasteful number, since it uses less digits than its factorization.
50060538 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1280 (or 1274 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 27.
The square root of 50060538 is about 7075.3471999613. The cubic root of 50060538 is about 368.5517724973.
The spelling of 50060538 in words is "fifty million, sixty thousand, five hundred thirty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •