Base | Representation |
---|---|
bin | 1100000001010… |
… | …1100101000000 |
3 | 10111212121021121 |
4 | 3000111211000 |
5 | 100401420112 |
6 | 5000402024 |
7 | 1151364115 |
oct | 300254500 |
9 | 114777247 |
10 | 50420032 |
11 | 26508353 |
12 | 14a76314 |
13 | a5a4650 |
14 | 69a690c |
15 | 465e407 |
hex | 3015940 |
50420032 has 28 divisors (see below), whose sum is σ = 107750356. Its totient is φ = 23270400.
The previous prime is 50420023. The next prime is 50420057. The reversal of 50420032 is 23002405.
It can be written as a sum of positive squares in 2 ways, for example, as 30206016 + 20214016 = 5496^2 + 4496^2 .
It is a Harshad number since it is a multiple of its sum of digits (16).
It is a junction number, because it is equal to n+sod(n) for n = 50419988 and 50420015.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 29469 + ... + 31132.
It is an arithmetic number, because the mean of its divisors is an integer number (3848227).
Almost surely, 250420032 is an apocalyptic number.
50420032 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
50420032 is an abundant number, since it is smaller than the sum of its proper divisors (57330324).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50420032 is a wasteful number, since it uses less digits than its factorization.
50420032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 60626 (or 60616 counting only the distinct ones).
The product of its (nonzero) digits is 240, while the sum is 16.
The square root of 50420032 is about 7100.7064437280. The cubic root of 50420032 is about 369.4318819622.
Adding to 50420032 its reverse (23002405), we get a palindrome (73422437).
The spelling of 50420032 in words is "fifty million, four hundred twenty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •