Base | Representation |
---|---|
bin | 1011100000101… |
… | …0001100011100 |
3 | 10100211200120100 |
4 | 2320022030130 |
5 | 44324320002 |
6 | 4442421100 |
7 | 1124225043 |
oct | 270121434 |
9 | 110750510 |
10 | 48276252 |
11 | 25283732 |
12 | 14201790 |
13 | a00393b |
14 | 65a955a |
15 | 438911c |
hex | 2e0a31c |
48276252 has 18 divisors (see below), whose sum is σ = 122031728. Its totient is φ = 16092072.
The previous prime is 48276233. The next prime is 48276253. The reversal of 48276252 is 25267284.
48276252 is a `hidden beast` number, since 4 + 8 + 27 + 625 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (18).
It is a Harshad number since it is a multiple of its sum of digits (36), and also a Moran number because the ratio is a prime number: 1341007 = 48276252 / (4 + 8 + 2 + 7 + 6 + 2 + 5 + 2).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48276253) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 670468 + ... + 670539.
Almost surely, 248276252 is an apocalyptic number.
It is an amenable number.
48276252 is an abundant number, since it is smaller than the sum of its proper divisors (73755476).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48276252 is a wasteful number, since it uses less digits than its factorization.
48276252 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1341017 (or 1341012 counting only the distinct ones).
The product of its digits is 53760, while the sum is 36.
The square root of 48276252 is about 6948.1113980707. Note that the first 3 decimals coincide. The cubic root of 48276252 is about 364.1199841948.
The spelling of 48276252 in words is "forty-eight million, two hundred seventy-six thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •