Base | Representation |
---|---|
bin | 1011111101100… |
… | …0010100101100 |
3 | 10111101212010000 |
4 | 2333120110230 |
5 | 100320403012 |
6 | 4551144300 |
7 | 1146300456 |
oct | 277302454 |
9 | 114355100 |
10 | 50169132 |
11 | 263568a2 |
12 | 14975090 |
13 | a5173a0 |
14 | 693d2d6 |
15 | 460eddc |
hex | 2fd852c |
50169132 has 120 divisors (see below), whose sum is σ = 145047056. Its totient is φ = 15023232.
The previous prime is 50169121. The next prime is 50169179. The reversal of 50169132 is 23196105.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a junction number, because it is equal to n+sod(n) for n = 50169096 and 50169105.
It is an unprimeable number.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 180978 + ... + 181254.
Almost surely, 250169132 is an apocalyptic number.
50169132 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 50169132, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72523528).
50169132 is an abundant number, since it is smaller than the sum of its proper divisors (94877924).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50169132 is a wasteful number, since it uses less digits than its factorization.
50169132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 349 (or 338 counting only the distinct ones).
The product of its (nonzero) digits is 1620, while the sum is 27.
The square root of 50169132 is about 7083.0171537276. The cubic root of 50169132 is about 368.8180741123.
The spelling of 50169132 in words is "fifty million, one hundred sixty-nine thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •