Base | Representation |
---|---|
bin | 1010001010110… |
… | …0001111010000 |
3 | 2222020202210010 |
4 | 2202230033100 |
5 | 41404223103 |
6 | 4122034520 |
7 | 1025335506 |
oct | 242541720 |
9 | 88222703 |
10 | 42648528 |
11 | 2208a51a |
12 | 12348a40 |
13 | 8ab3220 |
14 | 5942676 |
15 | 3b26903 |
hex | 28ac3d0 |
42648528 has 80 divisors (see below), whose sum is σ = 121617216. Its totient is φ = 12794880.
The previous prime is 42648523. The next prime is 42648547. The reversal of 42648528 is 82584624.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42648523) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24751 + ... + 26417.
Almost surely, 242648528 is an apocalyptic number.
42648528 is a gapful number since it is divisible by the number (48) 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 42648528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60808608).
42648528 is an abundant number, since it is smaller than the sum of its proper divisors (78968688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42648528 is a wasteful number, since it uses less digits than its factorization.
42648528 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1732 (or 1726 counting only the distinct ones).
The product of its digits is 122880, while the sum is 39.
The square root of 42648528 is about 6530.5840473881. The cubic root of 42648528 is about 349.3826614231.
The spelling of 42648528 in words is "forty-two million, six hundred forty-eight thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •