Base | Representation |
---|---|
bin | 1010001100011… |
… | …1110101011101 |
3 | 2222110111211200 |
4 | 2203013311131 |
5 | 41421332230 |
6 | 4124310113 |
7 | 1026316200 |
oct | 243076535 |
9 | 88414750 |
10 | 42761565 |
11 | 22157440 |
12 | 123a2339 |
13 | 8b22802 |
14 | 5971937 |
15 | 3b4a160 |
hex | 28c7d5d |
42761565 has 144 divisors (see below), whose sum is σ = 98594496. Its totient is φ = 16934400.
The previous prime is 42761561. The next prime is 42761569. The reversal of 42761565 is 56516724.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (42761561) and next prime (42761569).
It is not a de Polignac number, because 42761565 - 22 = 42761561 is a prime.
Its product of digits (50400) is a multiple of the sum of its prime factors (120).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42761561) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 994434 + ... + 994476.
It is an arithmetic number, because the mean of its divisors is an integer number (684684).
Almost surely, 242761565 is an apocalyptic number.
42761565 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
42761565 is an abundant number, since it is smaller than the sum of its proper divisors (55832931).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42761565 is a wasteful number, since it uses less digits than its factorization.
42761565 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 120 (or 110 counting only the distinct ones).
The product of its digits is 50400, while the sum is 36.
The square root of 42761565 is about 6539.2327531600. The cubic root of 42761565 is about 349.6910607179.
The spelling of 42761565 in words is "forty-two million, seven hundred sixty-one thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •