Base | Representation |
---|---|
bin | 1010001010000… |
… | …1000011101101 |
3 | 2222011102222000 |
4 | 2202201003231 |
5 | 41401241413 |
6 | 4121042513 |
7 | 1025055135 |
oct | 242410355 |
9 | 88142860 |
10 | 42602733 |
11 | 22059078 |
12 | 12326439 |
13 | 8a98424 |
14 | 592dac5 |
15 | 3b18073 |
hex | 28a10ed |
42602733 has 8 divisors (see below), whose sum is σ = 63115200. Its totient is φ = 28401804.
The previous prime is 42602719. The next prime is 42602761. The reversal of 42602733 is 33720624.
It is not a de Polignac number, because 42602733 - 24 = 42602717 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1577879 = 42602733 / (4 + 2 + 6 + 0 + 2 + 7 + 3 + 3).
It is a junction number, because it is equal to n+sod(n) for n = 42602697 and 42602706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42602713) 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, 788913 + ... + 788966.
It is an arithmetic number, because the mean of its divisors is an integer number (7889400).
Almost surely, 242602733 is an apocalyptic number.
It is an amenable number.
42602733 is a deficient number, since it is larger than the sum of its proper divisors (20512467).
42602733 is a wasteful number, since it uses less digits than its factorization.
42602733 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1577888 (or 1577882 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 27.
The square root of 42602733 is about 6527.0769108384. The cubic root of 42602733 is about 349.2575636378.
The spelling of 42602733 in words is "forty-two million, six hundred two thousand, seven hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •