Base | Representation |
---|---|
bin | 1010001100100… |
… | …0110010111101 |
3 | 2222110201020110 |
4 | 2203020302331 |
5 | 41421444001 |
6 | 4124340233 |
7 | 1026333522 |
oct | 243106275 |
9 | 88421213 |
10 | 42765501 |
11 | 2215a399 |
12 | 123a4679 |
13 | 8b2453c |
14 | 5973149 |
15 | 3b4b3d6 |
hex | 28c8cbd |
42765501 has 32 divisors (see below), whose sum is σ = 60963840. Its totient is φ = 26633600.
The previous prime is 42765491. The next prime is 42765511. The reversal of 42765501 is 10556724.
42765501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (42765491) and next prime (42765511).
It is not a de Polignac number, because 42765501 - 214 = 42749117 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42765511) 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 31 ways as a sum of consecutive naturals, for example, 515206 + ... + 515288.
It is an arithmetic number, because the mean of its divisors is an integer number (1905120).
Almost surely, 242765501 is an apocalyptic number.
42765501 is a gapful number since it is divisible by the number (41) formed by its first and last digit.
It is an amenable number.
42765501 is a deficient number, since it is larger than the sum of its proper divisors (18198339).
42765501 is a wasteful number, since it uses less digits than its factorization.
42765501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 257.
The product of its (nonzero) digits is 8400, while the sum is 30.
The square root of 42765501 is about 6539.5336989727. The cubic root of 42765501 is about 349.7017895253.
The spelling of 42765501 in words is "forty-two million, seven hundred sixty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •