Base | Representation |
---|---|
bin | 11101101001001… |
… | …11101110100000 |
3 | 122022221000021210 |
4 | 32310213232200 |
5 | 1002130101412 |
6 | 40401550120 |
7 | 6106463451 |
oct | 1664475640 |
9 | 568830253 |
10 | 248675232 |
11 | 118409423 |
12 | 6b345340 |
13 | 3c69a710 |
14 | 25053128 |
15 | 16c7183c |
hex | ed27ba0 |
248675232 has 96 divisors (see below), whose sum is σ = 727332480. Its totient is φ = 73866240.
The previous prime is 248675227. The next prime is 248675233. The reversal of 248675232 is 232576842.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (39).
It is not an unprimeable number, because it can be changed into a prime (248675233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 32757 + ... + 39627.
It is an arithmetic number, because the mean of its divisors is an integer number (7576380).
Almost surely, 2248675232 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 248675232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (363666240).
248675232 is an abundant number, since it is smaller than the sum of its proper divisors (478657248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
248675232 is a wasteful number, since it uses less digits than its factorization.
248675232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6926 (or 6918 counting only the distinct ones).
The product of its digits is 161280, while the sum is 39.
The square root of 248675232 is about 15769.4398124981. The cubic root of 248675232 is about 628.8458182594.
The spelling of 248675232 in words is "two hundred forty-eight million, six hundred seventy-five thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •