Base | Representation |
---|---|
bin | 1011110101011… |
… | …0010111110000 |
3 | 10110101210221210 |
4 | 2331112113300 |
5 | 100201334343 |
6 | 4531520120 |
7 | 1141622562 |
oct | 275262760 |
9 | 113353853 |
10 | 49636848 |
11 | 26022998 |
12 | 14759040 |
13 | a38c021 |
14 | 6841332 |
15 | 4557333 |
hex | 2f565f0 |
49636848 has 20 divisors (see below), whose sum is σ = 128228648. Its totient is φ = 16545600.
The previous prime is 49636843. The next prime is 49636907. The reversal of 49636848 is 84863694.
It is a Harshad number since it is a multiple of its sum of digits (48), and also a Moran number because the ratio is a prime number: 1034101 = 49636848 / (4 + 9 + 6 + 3 + 6 + 8 + 4 + 8).
It is a junction number, because it is equal to n+sod(n) for n = 49636797 and 49636806.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (49636843) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 517003 + ... + 517098.
Almost surely, 249636848 is an apocalyptic number.
49636848 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
49636848 is an abundant number, since it is smaller than the sum of its proper divisors (78591800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
49636848 is a wasteful number, since it uses less digits than its factorization.
49636848 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1034112 (or 1034106 counting only the distinct ones).
The product of its digits is 995328, while the sum is 48.
The square root of 49636848 is about 7045.3422911878. The cubic root of 49636848 is about 367.5090728474.
It can be divided in two parts, 4963 and 6848, that added together give a palindrome (11811).
The spelling of 49636848 in words is "forty-nine million, six hundred thirty-six thousand, eight hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •