Base | Representation |
---|---|
bin | 1011100100100… |
… | …0111010001101 |
3 | 10101022201221110 |
4 | 2321020322031 |
5 | 44411030013 |
6 | 4452122233 |
7 | 1126345005 |
oct | 271107215 |
9 | 111281843 |
10 | 48533133 |
11 | 25439730 |
12 | 14306379 |
13 | a09383c |
14 | 6635005 |
15 | 43da2c3 |
hex | 2e48e8d |
48533133 has 16 divisors (see below), whose sum is σ = 70718976. Its totient is φ = 29361840.
The previous prime is 48533129. The next prime is 48533137. The reversal of 48533133 is 33133584.
48533133 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (48533129) and next prime (48533137).
It is not a de Polignac number, because 48533133 - 22 = 48533129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 48533133.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48533137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 26266 + ... + 28052.
It is an arithmetic number, because the mean of its divisors is an integer number (4419936).
Almost surely, 248533133 is an apocalyptic number.
It is an amenable number.
48533133 is a deficient number, since it is larger than the sum of its proper divisors (22185843).
48533133 is a wasteful number, since it uses less digits than its factorization.
48533133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2624.
The product of its digits is 12960, while the sum is 30.
The square root of 48533133 is about 6966.5725432238. The cubic root of 48533133 is about 364.7646772388.
The spelling of 48533133 in words is "forty-eight million, five hundred thirty-three thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •