Base | Representation |
---|---|
bin | 1010001001000… |
… | …0110111110101 |
3 | 2222001002000121 |
4 | 2202100313311 |
5 | 41342131222 |
6 | 4115411541 |
7 | 1024360636 |
oct | 242206765 |
9 | 88032017 |
10 | 42536437 |
11 | 22013289 |
12 | 122b3bb1 |
13 | 8a741b8 |
14 | 591388d |
15 | 3b035c7 |
hex | 2890df5 |
42536437 has 4 divisors (see below), whose sum is σ = 42752556. Its totient is φ = 42320320.
The previous prime is 42536381. The next prime is 42536441. The reversal of 42536437 is 73463524.
42536437 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 41873841 + 662596 = 6471^2 + 814^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42536437 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42536467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 107764 + ... + 108157.
It is an arithmetic number, because the mean of its divisors is an integer number (10688139).
Almost surely, 242536437 is an apocalyptic number.
It is an amenable number.
42536437 is a deficient number, since it is larger than the sum of its proper divisors (216119).
42536437 is a wasteful number, since it uses less digits than its factorization.
42536437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216118.
The product of its digits is 60480, while the sum is 34.
The square root of 42536437 is about 6521.9963968098. The cubic root of 42536437 is about 349.0763045282.
The spelling of 42536437 in words is "forty-two million, five hundred thirty-six thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •