Base | Representation |
---|---|
bin | 11101100101100… |
… | …10101000110000 |
3 | 122022000122101211 |
4 | 32302302220300 |
5 | 1002014230012 |
6 | 40343405504 |
7 | 6102425266 |
oct | 1662625060 |
9 | 568018354 |
10 | 248195632 |
11 | 118111063 |
12 | 6b153894 |
13 | 3c560329 |
14 | 24d6a436 |
15 | 16bc96a7 |
hex | ecb2a30 |
248195632 has 40 divisors (see below), whose sum is σ = 518560560. Its totient is φ = 114693120.
The previous prime is 248195617. The next prime is 248195653. The reversal of 248195632 is 236591842.
It is a hoax number, since the sum of its digits (40) coincides with the sum of the digits of its distinct prime factors.
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 7 ways as a sum of consecutive naturals, for example, 2508 + ... + 22420.
It is an arithmetic number, because the mean of its divisors is an integer number (12964014).
Almost surely, 2248195632 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 248195632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (259280280).
248195632 is an abundant number, since it is smaller than the sum of its proper divisors (270364928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
248195632 is a wasteful number, since it uses less digits than its factorization.
248195632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19981 (or 19975 counting only the distinct ones).
The product of its digits is 103680, while the sum is 40.
The square root of 248195632 is about 15754.2258457850. The cubic root of 248195632 is about 628.4412899019.
The spelling of 248195632 in words is "two hundred forty-eight million, one hundred ninety-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •