Base | Representation |
---|---|
bin | 1010001100100… |
… | …0110110101000 |
3 | 2222110201120011 |
4 | 2203020312220 |
5 | 41422000421 |
6 | 4124341304 |
7 | 1026334306 |
oct | 243106650 |
9 | 88421504 |
10 | 42765736 |
11 | 2215a592 |
12 | 123a4834 |
13 | 8b24690 |
14 | 5973276 |
15 | 3b4b4e1 |
hex | 28c8da8 |
42765736 has 64 divisors (see below), whose sum is σ = 90256320. Its totient is φ = 18869760.
The previous prime is 42765733. The next prime is 42765739. The reversal of 42765736 is 63756724.
It is an interprime number because it is at equal distance from previous prime (42765733) and next prime (42765739).
It is not an unprimeable number, because it can be changed into a prime (42765731) 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 15 ways as a sum of consecutive naturals, for example, 326391 + ... + 326521.
It is an arithmetic number, because the mean of its divisors is an integer number (1410255).
Almost surely, 242765736 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42765736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45128160).
42765736 is an abundant number, since it is smaller than the sum of its proper divisors (47490584).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42765736 is a wasteful number, since it uses less digits than its factorization.
42765736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 266 (or 262 counting only the distinct ones).
The product of its digits is 211680, while the sum is 40.
The square root of 42765736 is about 6539.5516665900. The cubic root of 42765736 is about 349.7024300710.
The spelling of 42765736 in words is "forty-two million, seven hundred sixty-five thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •