Base | Representation |
---|---|
bin | 1010001100100… |
… | …1000111110101 |
3 | 2222110210001221 |
4 | 2203021013311 |
5 | 41422014322 |
6 | 4124350341 |
7 | 1026340441 |
oct | 243110765 |
9 | 88423057 |
10 | 42766837 |
11 | 221603a3 |
12 | 123a53b1 |
13 | 8b25029 |
14 | 5973821 |
15 | 3b4b9c7 |
hex | 28c91f5 |
42766837 has 8 divisors (see below), whose sum is σ = 43535232. Its totient is φ = 42002400.
The previous prime is 42766819. The next prime is 42766961. The reversal of 42766837 is 73866724.
It is a happy number.
42766837 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 42766837 - 223 = 34378229 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 42766793 and 42766802.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42763837) 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 7 ways as a sum of consecutive naturals, for example, 28137 + ... + 29617.
It is an arithmetic number, because the mean of its divisors is an integer number (5441904).
Almost surely, 242766837 is an apocalyptic number.
It is an amenable number.
42766837 is a deficient number, since it is larger than the sum of its proper divisors (768395).
42766837 is a wasteful number, since it uses less digits than its factorization.
42766837 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1979.
The product of its digits is 338688, while the sum is 43.
The square root of 42766837 is about 6539.6358461309. The cubic root of 42766837 is about 349.7054310644.
The spelling of 42766837 in words is "forty-two million, seven hundred sixty-six thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •