Base | Representation |
---|---|
bin | 1010001000111… |
… | …0000100011101 |
3 | 2222000111021102 |
4 | 2202032010131 |
5 | 41341244312 |
6 | 4115242445 |
7 | 1024312316 |
oct | 242160435 |
9 | 88014242 |
10 | 42524957 |
11 | 220056a2 |
12 | 122a9425 |
13 | 8a6bbc7 |
14 | 590d60d |
15 | 3aeeec2 |
hex | 288e11d |
42524957 has 8 divisors (see below), whose sum is σ = 42946680. Its totient is φ = 42105600.
The previous prime is 42524947. The next prime is 42524959. The reversal of 42524957 is 75942524.
It can be written as a sum of positive squares in 4 ways, for example, as 32501401 + 10023556 = 5701^2 + 3166^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42524957 - 24 = 42524941 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 42524957.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42524959) 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 7 ways as a sum of consecutive naturals, for example, 70457 + ... + 71057.
It is an arithmetic number, because the mean of its divisors is an integer number (5368335).
Almost surely, 242524957 is an apocalyptic number.
It is an amenable number.
42524957 is a deficient number, since it is larger than the sum of its proper divisors (421723).
42524957 is a wasteful number, since it uses less digits than its factorization.
42524957 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1183.
The product of its digits is 100800, while the sum is 38.
The square root of 42524957 is about 6521.1162388045. The cubic root of 42524957 is about 349.0448980696.
The spelling of 42524957 in words is "forty-two million, five hundred twenty-four thousand, nine hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •