Base | Representation |
---|---|
bin | 1100000001010… |
… | …1100011111000 |
3 | 10111212121011221 |
4 | 3000111203320 |
5 | 100401414320 |
6 | 5000401424 |
7 | 1151363653 |
oct | 300254370 |
9 | 114777157 |
10 | 50419960 |
11 | 26508298 |
12 | 14a76274 |
13 | a5a45c6 |
14 | 69a689a |
15 | 465e3aa |
hex | 30158f8 |
50419960 has 64 divisors (see below), whose sum is σ = 122472000. Its totient is φ = 18610176.
The previous prime is 50419949. The next prime is 50419969. The reversal of 50419960 is 6991405.
It is a Harshad number since it is a multiple of its sum of digits (34).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50419969) 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 15 ways as a sum of consecutive naturals, for example, 35341 + ... + 36739.
It is an arithmetic number, because the mean of its divisors is an integer number (1913625).
Almost surely, 250419960 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50419960, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61236000).
50419960 is an abundant number, since it is smaller than the sum of its proper divisors (72052040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50419960 is a wasteful number, since it uses less digits than its factorization.
50419960 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1480 (or 1476 counting only the distinct ones).
The product of its (nonzero) digits is 9720, while the sum is 34.
The square root of 50419960 is about 7100.7013738081. The cubic root of 50419960 is about 369.4317061120.
The spelling of 50419960 in words is "fifty million, four hundred nineteen thousand, nine hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •