Base | Representation |
---|---|
bin | 1000011010000… |
… | …10111011110000 |
3 | 11220201020021000 |
4 | 10031002323300 |
5 | 121023410002 |
6 | 10555402000 |
7 | 1514325120 |
oct | 415027360 |
9 | 156636230 |
10 | 70528752 |
11 | 368a2328 |
12 | 1b753300 |
13 | 117c53b8 |
14 | 951cc80 |
15 | 62d261c |
hex | 4342ef0 |
70528752 has 160 divisors (see below), whose sum is σ = 234984960. Its totient is φ = 19837440.
The previous prime is 70528747. The next prime is 70528753. The reversal of 70528752 is 25782507.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (70528753) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 250852 + ... + 251132.
It is an arithmetic number, because the mean of its divisors is an integer number (1468656).
Almost surely, 270528752 is an apocalyptic number.
70528752 is a gapful number since it is divisible by the number (72) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 70528752, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (117492480).
70528752 is an abundant number, since it is smaller than the sum of its proper divisors (164456208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
70528752 is a wasteful number, since it uses less digits than its factorization.
70528752 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 388 (or 376 counting only the distinct ones).
The product of its (nonzero) digits is 39200, while the sum is 36.
The square root of 70528752 is about 8398.1397940258. The cubic root of 70528752 is about 413.1636128265.
The spelling of 70528752 in words is "seventy million, five hundred twenty-eight thousand, seven hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •