Base | Representation |
---|---|
bin | 1100000110011… |
… | …1000111111000 |
3 | 10112111120110021 |
4 | 3001213013320 |
5 | 100443112130 |
6 | 5011500224 |
7 | 1154254651 |
oct | 301470770 |
9 | 115446407 |
10 | 50754040 |
11 | 26716297 |
12 | 14bb7674 |
13 | a69069c |
14 | 6a52528 |
15 | 46c837a |
hex | 30671f8 |
50754040 has 32 divisors (see below), whose sum is σ = 114696000. Its totient is φ = 20212864.
The previous prime is 50754007. The next prime is 50754049. The reversal of 50754040 is 4045705.
50754040 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a zygodrome in base 2.
It is a junction number, because it is equal to n+sod(n) for n = 50753996 and 50754014.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50754049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6906 + ... + 12214.
It is an arithmetic number, because the mean of its divisors is an integer number (3584250).
Almost surely, 250754040 is an apocalyptic number.
It is an amenable number.
50754040 is an abundant number, since it is smaller than the sum of its proper divisors (63941960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50754040 is a wasteful number, since it uses less digits than its factorization.
50754040 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5559 (or 5555 counting only the distinct ones).
The product of its (nonzero) digits is 2800, while the sum is 25.
The square root of 50754040 is about 7124.1869711568. The cubic root of 50754040 is about 370.2458555910.
Adding to 50754040 its reverse (4045705), we get a palindrome (54799745).
The spelling of 50754040 in words is "fifty million, seven hundred fifty-four thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •