Base | Representation |
---|---|
bin | 1010001111011… |
… | …0011111101000 |
3 | 2222211020000000 |
4 | 2203312133220 |
5 | 41443441210 |
6 | 4132343000 |
7 | 1031043321 |
oct | 243663750 |
9 | 88736000 |
10 | 42952680 |
11 | 22277a91 |
12 | 12474a60 |
13 | 8b8b7b4 |
14 | 59c1448 |
15 | 3b86ac0 |
hex | 28f67e8 |
42952680 has 128 divisors (see below), whose sum is σ = 145238400. Its totient is φ = 11430720.
The previous prime is 42952669. The next prime is 42952681. The reversal of 42952680 is 8625924.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (42952681) 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, 87235 + ... + 87725.
It is an arithmetic number, because the mean of its divisors is an integer number (1134675).
Almost surely, 242952680 is an apocalyptic number.
42952680 is a gapful number since it is divisible by the number (40) 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 42952680, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (72619200).
42952680 is an abundant number, since it is smaller than the sum of its proper divisors (102285720).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42952680 is an equidigital number, since it uses as much as digits as its factorization.
42952680 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 523 (or 501 counting only the distinct ones).
The product of its (nonzero) digits is 34560, while the sum is 36.
The square root of 42952680 is about 6553.8294149299. The cubic root of 42952680 is about 350.2112466236.
The spelling of 42952680 in words is "forty-two million, nine hundred fifty-two thousand, six hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •