Base | Representation |
---|---|
bin | 1100000101001… |
… | …1010000000000 |
3 | 10112100102210110 |
4 | 3001103100000 |
5 | 100433011030 |
6 | 5010031320 |
7 | 1153465434 |
oct | 301232000 |
9 | 115312713 |
10 | 50672640 |
11 | 26670117 |
12 | 14b78540 |
13 | a662615 |
14 | 6a309c4 |
15 | 46ae1b0 |
hex | 3053400 |
50672640 has 88 divisors (see below), whose sum is σ = 162122400. Its totient is φ = 13508608.
The previous prime is 50672623. The next prime is 50672653. The reversal of 50672640 is 4627605.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 50672598 and 50672607.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13711 + ... + 17009.
It is an arithmetic number, because the mean of its divisors is an integer number (1842300).
Almost surely, 250672640 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 50672640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (81061200).
50672640 is an abundant number, since it is smaller than the sum of its proper divisors (111449760).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50672640 is a wasteful number, since it uses less digits than its factorization.
50672640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3327 (or 3309 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 30.
The square root of 50672640 is about 7118.4717460983. The cubic root of 50672640 is about 370.0478146145.
The spelling of 50672640 in words is "fifty million, six hundred seventy-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •