Base | Representation |
---|---|
bin | 1010001011010… |
… | …1001010001111 |
3 | 2222022121220120 |
4 | 2202311022033 |
5 | 41411410241 |
6 | 4122520023 |
7 | 1025550162 |
oct | 242651217 |
9 | 88277816 |
10 | 42685071 |
11 | 22104a20 |
12 | 12366013 |
13 | 8ac6a50 |
14 | 5951ad9 |
15 | 3b32666 |
hex | 28b528f |
42685071 has 64 divisors (see below), whose sum is σ = 71608320. Its totient is φ = 22256640.
The previous prime is 42685067. The next prime is 42685169. The reversal of 42685071 is 17058624.
42685071 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42685071 - 22 = 42685067 is a prime.
It is a super-3 number, since 3×426850713 (a number of 24 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42685471) 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 63 ways as a sum of consecutive naturals, for example, 584691 + ... + 584763.
It is an arithmetic number, because the mean of its divisors is an integer number (1118880).
Almost surely, 242685071 is an apocalyptic number.
42685071 is a deficient number, since it is larger than the sum of its proper divisors (28923249).
42685071 is a wasteful number, since it uses less digits than its factorization.
42685071 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 176.
The product of its (nonzero) digits is 13440, while the sum is 33.
The square root of 42685071 is about 6533.3812838376. The cubic root of 42685071 is about 349.4824213786.
It can be divided in two parts, 4268 and 5071, that added together give a palindrome (9339).
The spelling of 42685071 in words is "forty-two million, six hundred eighty-five thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •