Base | Representation |
---|---|
bin | 1010001001101… |
… | …1101000100000 |
3 | 2222010022111000 |
4 | 2202123220200 |
5 | 41400034022 |
6 | 4120352000 |
7 | 1024633302 |
oct | 242335040 |
9 | 88108430 |
10 | 42580512 |
11 | 22043407 |
12 | 12315600 |
13 | 8a8b290 |
14 | 5925972 |
15 | 3b116ac |
hex | 289ba20 |
42580512 has 192 divisors, whose sum is σ = 142248960. Its totient is φ = 12275712.
The previous prime is 42580471. The next prime is 42580513. The reversal of 42580512 is 21508524.
It is a happy number.
It is a super-3 number, since 3×425805123 (a number of 24 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42580513) 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, 190833 + ... + 191055.
It is an arithmetic number, because the mean of its divisors is an integer number (740880).
Almost surely, 242580512 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 42580512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (71124480).
42580512 is an abundant number, since it is smaller than the sum of its proper divisors (99668448).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42580512 is a wasteful number, since it uses less digits than its factorization.
42580512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 272 (or 258 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
The square root of 42580512 is about 6525.3744720131. The cubic root of 42580512 is about 349.1968304291.
The spelling of 42580512 in words is "forty-two million, five hundred eighty thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •