Base | Representation |
---|---|
bin | 1011100100010… |
… | …0100010101010 |
3 | 10101021211101211 |
4 | 2321010202222 |
5 | 44404441432 |
6 | 4451503334 |
7 | 1126241566 |
oct | 271044252 |
9 | 111254354 |
10 | 48515242 |
11 | 25427246 |
12 | 142b7b4a |
13 | a088659 |
14 | 662c6a6 |
15 | 43d4d47 |
hex | 2e448aa |
48515242 has 8 divisors (see below), whose sum is σ = 72804996. Its totient is φ = 24246912.
The previous prime is 48515239. The next prime is 48515267. The reversal of 48515242 is 24251584.
It can be written as a sum of positive squares in 2 ways, for example, as 45414121 + 3101121 = 6739^2 + 1761^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 2778 + ... + 10234.
Almost surely, 248515242 is an apocalyptic number.
48515242 is a deficient number, since it is larger than the sum of its proper divisors (24289754).
48515242 is a wasteful number, since it uses less digits than its factorization.
48515242 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10712.
The product of its digits is 12800, while the sum is 31.
The square root of 48515242 is about 6965.2883644541. The cubic root of 48515242 is about 364.7198500833.
The spelling of 48515242 in words is "forty-eight million, five hundred fifteen thousand, two hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •