Base | Representation |
---|---|
bin | 1011100100110… |
… | …1110101000001 |
3 | 10101100202120200 |
4 | 2321031311001 |
5 | 44412201111 |
6 | 4452355413 |
7 | 1126460520 |
oct | 271156501 |
9 | 111322520 |
10 | 48553281 |
11 | 25452887 |
12 | 14315b69 |
13 | a09ca6a |
14 | 663c4b7 |
15 | 43e1256 |
hex | 2e4dd41 |
48553281 has 24 divisors (see below), whose sum is σ = 80418624. Its totient is φ = 27652320.
The previous prime is 48553261. The next prime is 48553291. The reversal of 48553281 is 18235584.
It is a happy number.
48553281 is a `hidden beast` number, since 48 + 5 + 532 + 81 = 666.
48553281 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 48553281 - 26 = 48553217 is a prime.
It is a super-2 number, since 2×485532812 = 4714842191729922, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48553231) 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 23 ways as a sum of consecutive naturals, for example, 20751 + ... + 22971.
It is an arithmetic number, because the mean of its divisors is an integer number (3350776).
Almost surely, 248553281 is an apocalyptic number.
It is an amenable number.
48553281 is a deficient number, since it is larger than the sum of its proper divisors (31865343).
48553281 is a wasteful number, since it uses less digits than its factorization.
48553281 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2581 (or 2578 counting only the distinct ones).
The product of its digits is 38400, while the sum is 36.
The square root of 48553281 is about 6968.0184414222. The cubic root of 48553281 is about 364.8151462793.
The spelling of 48553281 in words is "forty-eight million, five hundred fifty-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •