Base | Representation |
---|---|
bin | 1100000100101… |
… | …1110001010000 |
3 | 10112021212202122 |
4 | 3001023301100 |
5 | 100431021000 |
6 | 5005233412 |
7 | 1153310213 |
oct | 301136120 |
9 | 115255678 |
10 | 50642000 |
11 | 2664a0a2 |
12 | 14b62868 |
13 | a6516a6 |
14 | 6a2377a |
15 | 46a5085 |
hex | 304bc50 |
50642000 has 40 divisors (see below), whose sum is σ = 122457192. Its totient is φ = 20256000.
The previous prime is 50641999. The next prime is 50642023. The reversal of 50642000 is 24605.
It can be written as a sum of positive squares in 4 ways, for example, as 118336 + 50523664 = 344^2 + 7108^2 .
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×506420002 = 5129224328000000, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 50642000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 10661 + ... + 14660.
Almost surely, 250642000 is an apocalyptic number.
50642000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50642000 is an abundant number, since it is smaller than the sum of its proper divisors (71815192).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50642000 is a wasteful number, since it uses less digits than its factorization.
50642000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 25344 (or 25328 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 17.
The square root of 50642000 is about 7116.3192733322. The cubic root of 50642000 is about 369.9732145207.
Adding to 50642000 its reverse (24605), we get a palindrome (50666605).
The spelling of 50642000 in words is "fifty million, six hundred forty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •