Base | Representation |
---|---|
bin | 1011100101000… |
… | …1001111001010 |
3 | 10101101110201202 |
4 | 2321101033022 |
5 | 44413122432 |
6 | 4452544202 |
7 | 1126546313 |
oct | 271211712 |
9 | 111343652 |
10 | 48567242 |
11 | 25462319 |
12 | 14322062 |
13 | a0a6219 |
14 | 664360a |
15 | 43e5462 |
hex | 2e513ca |
48567242 has 8 divisors (see below), whose sum is σ = 72890496. Its totient is φ = 24270412.
The previous prime is 48567223. The next prime is 48567251. The reversal of 48567242 is 24276584.
48567242 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 48567196 and 48567205.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 1088 + ... + 9915.
It is an arithmetic number, because the mean of its divisors is an integer number (9111312).
Almost surely, 248567242 is an apocalyptic number.
48567242 is a deficient number, since it is larger than the sum of its proper divisors (24323254).
48567242 is a wasteful number, since it uses less digits than its factorization.
48567242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13212.
The product of its digits is 107520, while the sum is 38.
The square root of 48567242 is about 6969.0201606826. The cubic root of 48567242 is about 364.8501092181.
The spelling of 48567242 in words is "forty-eight million, five hundred sixty-seven thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •