Base | Representation |
---|---|
bin | 1100000001111… |
… | …0010111100000 |
3 | 10111221102122221 |
4 | 3000132113200 |
5 | 100404043112 |
6 | 5001240424 |
7 | 1151604064 |
oct | 300362740 |
9 | 114842587 |
10 | 50456032 |
11 | 26532400 |
12 | 14a93114 |
13 | a5b7b53 |
14 | 69b5aa4 |
15 | 4669e07 |
hex | 301e5e0 |
50456032 has 72 divisors (see below), whose sum is σ = 111206088. Its totient is φ = 22513920.
The previous prime is 50456011. The next prime is 50456047. The reversal of 50456032 is 23065405.
It is a super-2 number, since 2×504560322 = 5091622330370048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50455988 and 50456006.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 321298 + ... + 321454.
It is an arithmetic number, because the mean of its divisors is an integer number (1544529).
Almost surely, 250456032 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 50456032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (55603044).
50456032 is an abundant number, since it is smaller than the sum of its proper divisors (60750056).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50456032 is a wasteful number, since it uses less digits than its factorization.
50456032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 272 (or 253 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 25.
The square root of 50456032 is about 7103.2409504395. The cubic root of 50456032 is about 369.5197860695.
The spelling of 50456032 in words is "fifty million, four hundred fifty-six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •