Base | Representation |
---|---|
bin | 1011100100001… |
… | …0010101110101 |
3 | 10101021101001000 |
4 | 2321002111311 |
5 | 44404144404 |
6 | 4451353513 |
7 | 1126203402 |
oct | 271022565 |
9 | 111241030 |
10 | 48506229 |
11 | 254204a2 |
12 | 142b2899 |
13 | a084515 |
14 | 66292a9 |
15 | 43d2339 |
hex | 2e42575 |
48506229 has 8 divisors (see below), whose sum is σ = 71861120. Its totient is φ = 32337468.
The previous prime is 48506207. The next prime is 48506233. The reversal of 48506229 is 92260584.
It is a happy number.
48506229 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 48506229 - 28 = 48505973 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 48506193 and 48506202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (48506329) 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 7 ways as a sum of consecutive naturals, for example, 898237 + ... + 898290.
It is an arithmetic number, because the mean of its divisors is an integer number (8982640).
Almost surely, 248506229 is an apocalyptic number.
It is an amenable number.
48506229 is a deficient number, since it is larger than the sum of its proper divisors (23354891).
48506229 is a wasteful number, since it uses less digits than its factorization.
48506229 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1796536 (or 1796530 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 48506229 is about 6964.6413403707. The cubic root of 48506229 is about 364.6972632050.
The spelling of 48506229 in words is "forty-eight million, five hundred six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •