Base | Representation |
---|---|
bin | 1011101101001… |
… | …0010111011000 |
3 | 10102101100021000 |
4 | 2323102113120 |
5 | 100032034102 |
6 | 4512145000 |
7 | 1134211320 |
oct | 273222730 |
9 | 112340230 |
10 | 49096152 |
11 | 25793736 |
12 | 14538160 |
13 | a22cba1 |
14 | 6740280 |
15 | 449c01c |
hex | 2ed25d8 |
49096152 has 128 divisors (see below), whose sum is σ = 164160000. Its totient is φ = 13281408.
The previous prime is 49096141. The next prime is 49096181. The reversal of 49096152 is 25169094.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 27874 + ... + 29582.
It is an arithmetic number, because the mean of its divisors is an integer number (1282500).
Almost surely, 249096152 is an apocalyptic number.
49096152 is a gapful number since it is divisible by the number (42) 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 49096152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (82080000).
49096152 is an abundant number, since it is smaller than the sum of its proper divisors (115063848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49096152 is a wasteful number, since it uses less digits than its factorization.
49096152 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1750 (or 1740 counting only the distinct ones).
The product of its (nonzero) digits is 19440, while the sum is 36.
The square root of 49096152 is about 7006.8646340571. The cubic root of 49096152 is about 366.1697680568.
The spelling of 49096152 in words is "forty-nine million, ninety-six thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •