Base | Representation |
---|---|
bin | 1100000101101… |
… | …1011001110000 |
3 | 10112102010121012 |
4 | 3001123121300 |
5 | 100440043112 |
6 | 5010450052 |
7 | 1153664666 |
oct | 301333160 |
9 | 115363535 |
10 | 50706032 |
11 | 26693213 |
12 | 14b93928 |
13 | a674890 |
14 | 6a3cc36 |
15 | 46b9022 |
hex | 305b670 |
50706032 has 40 divisors (see below), whose sum is σ = 106232784. Its totient is φ = 23307264.
The previous prime is 50706023. The next prime is 50706077. The reversal of 50706032 is 23060705.
It is a super-2 number, since 2×507060322 = 5142203362370048, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50705989 and 50706007.
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, 89783 + ... + 90345.
Almost surely, 250706032 is an apocalyptic number.
50706032 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50706032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53116392).
50706032 is an abundant number, since it is smaller than the sum of its proper divisors (55526752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50706032 is a wasteful number, since it uses less digits than its factorization.
50706032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1017 (or 1011 counting only the distinct ones).
The product of its (nonzero) digits is 1260, while the sum is 23.
The square root of 50706032 is about 7120.8168070805. The cubic root of 50706032 is about 370.1290808453.
Adding to 50706032 its reverse (23060705), we get a palindrome (73766737).
The spelling of 50706032 in words is "fifty million, seven hundred six thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •