Base | Representation |
---|---|
bin | 1001000010110… |
… | …10110001000000 |
3 | 12021202120001011 |
4 | 10201122301000 |
5 | 123410303443 |
6 | 11310050304 |
7 | 1610610100 |
oct | 441326100 |
9 | 167676034 |
10 | 75869248 |
11 | 3990a764 |
12 | 214a9994 |
13 | 12945160 |
14 | a10d200 |
15 | 69d9b9d |
hex | 485ac40 |
75869248 has 84 divisors (see below), whose sum is σ = 188706252. Its totient is φ = 29998080.
The previous prime is 75869239. The next prime is 75869263. The reversal of 75869248 is 84296857.
It can be written as a sum of positive squares in 2 ways, for example, as 3415104 + 72454144 = 1848^2 + 8512^2 .
It is a super-2 number, since 2×758692482 = 11512285584171008, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (49).
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 39838 + ... + 41698.
It is an arithmetic number, because the mean of its divisors is an integer number (2246503).
Almost surely, 275869248 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 75869248, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (94353126).
75869248 is an abundant number, since it is smaller than the sum of its proper divisors (112837004).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
75869248 is a wasteful number, since it uses less digits than its factorization.
75869248 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1900 (or 1883 counting only the distinct ones).
The product of its digits is 967680, while the sum is 49.
The square root of 75869248 is about 8710.2955173748. The cubic root of 75869248 is about 423.3393056521.
The spelling of 75869248 in words is "seventy-five million, eight hundred sixty-nine thousand, two hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •