Base | Representation |
---|---|
bin | 1010001001100… |
… | …0111101000001 |
3 | 2222002202102112 |
4 | 2202120331001 |
5 | 41344211122 |
6 | 4120225105 |
7 | 1024556303 |
oct | 242307501 |
9 | 88082375 |
10 | 42569537 |
11 | 2203613a |
12 | 1230b195 |
13 | 8a8629a |
14 | 5921973 |
15 | 3b0d2e2 |
hex | 2898f41 |
42569537 has 4 divisors (see below), whose sum is σ = 42757296. Its totient is φ = 42381780.
The previous prime is 42569531. The next prime is 42569543. The reversal of 42569537 is 73596524.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (42569531) and next prime (42569543).
It is a cyclic number.
It is not a de Polignac number, because 42569537 - 212 = 42565441 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42569494 and 42569503.
It is not an unprimeable number, because it can be changed into a prime (42569531) 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 3 ways as a sum of consecutive naturals, for example, 93539 + ... + 93992.
It is an arithmetic number, because the mean of its divisors is an integer number (10689324).
Almost surely, 242569537 is an apocalyptic number.
It is an amenable number.
42569537 is a deficient number, since it is larger than the sum of its proper divisors (187759).
42569537 is a wasteful number, since it uses less digits than its factorization.
42569537 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187758.
The product of its digits is 226800, while the sum is 41.
The square root of 42569537 is about 6524.5334699119. The cubic root of 42569537 is about 349.1668263705.
The spelling of 42569537 in words is "forty-two million, five hundred sixty-nine thousand, five hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •