Base | Representation |
---|---|
bin | 1011111101100… |
… | …1001101011000 |
3 | 10111102001002101 |
4 | 2333121031120 |
5 | 100321012020 |
6 | 4551213144 |
7 | 1146314161 |
oct | 277311530 |
9 | 114361071 |
10 | 50172760 |
11 | 263595a0 |
12 | 149771b4 |
13 | a518c31 |
14 | 6940768 |
15 | 461100a |
hex | 2fd9358 |
50172760 has 64 divisors (see below), whose sum is σ = 124480800. Its totient is φ = 18048000.
The previous prime is 50172757. The next prime is 50172767. The reversal of 50172760 is 6727105.
It is a Smith number, since the sum of its digits (28) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50172767) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 43876 + ... + 45004.
Almost surely, 250172760 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 50172760, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62240400).
50172760 is an abundant number, since it is smaller than the sum of its proper divisors (74308040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50172760 is a wasteful number, since it uses less digits than its factorization.
50172760 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1252 (or 1248 counting only the distinct ones).
The product of its (nonzero) digits is 2940, while the sum is 28.
The square root of 50172760 is about 7083.2732546472. The cubic root of 50172760 is about 368.8269643048.
Adding to 50172760 its reverse (6727105), we get a palindrome (56899865).
It can be divided in two parts, 5017 and 2760, that added together give a palindrome (7777).
The spelling of 50172760 in words is "fifty million, one hundred seventy-two thousand, seven hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •