Base | Representation |
---|---|
bin | 1011101000111… |
… | …1111111011110 |
3 | 10101212112022220 |
4 | 2322033333132 |
5 | 44444334121 |
6 | 4502250210 |
7 | 1131666600 |
oct | 272177736 |
9 | 111775286 |
10 | 48824286 |
11 | 25618455 |
12 | 14426966 |
13 | a166214 |
14 | 66ad170 |
15 | 44466c6 |
hex | 2e8ffde |
48824286 has 48 divisors (see below), whose sum is σ = 115240320. Its totient is φ = 13747440.
The previous prime is 48824273. The next prime is 48824299. The reversal of 48824286 is 68242884.
It is an interprime number because it is at equal distance from previous prime (48824273) and next prime (48824299).
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 19705 + ... + 22043.
It is an arithmetic number, because the mean of its divisors is an integer number (2400840).
Almost surely, 248824286 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 48824286, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57620160).
48824286 is an abundant number, since it is smaller than the sum of its proper divisors (66416034).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
48824286 is a wasteful number, since it uses less digits than its factorization.
48824286 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2429 (or 2422 counting only the distinct ones).
The product of its digits is 196608, while the sum is 42.
The square root of 48824286 is about 6987.4377278084. The cubic root of 48824286 is about 365.4926380994.
The spelling of 48824286 in words is "forty-eight million, eight hundred twenty-four thousand, two hundred eighty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •