Base | Representation |
---|---|
bin | 1010001100100… |
… | …0110110101011 |
3 | 2222110201120021 |
4 | 2203020312223 |
5 | 41422000424 |
6 | 4124341311 |
7 | 1026334312 |
oct | 243106653 |
9 | 88421507 |
10 | 42765739 |
11 | 2215a595 |
12 | 123a4837 |
13 | 8b24693 |
14 | 5973279 |
15 | 3b4b4e4 |
hex | 28c8dab |
42765739 has 2 divisors, whose sum is σ = 42765740. Its totient is φ = 42765738.
The previous prime is 42765733. The next prime is 42765743. The reversal of 42765739 is 93756724.
42765739 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 42765739 - 23 = 42765731 is a prime.
It is a super-2 number, since 2×427657392 = 3657816864432242, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42765695 and 42765704.
It is not a weakly prime, because it can be changed into another prime (42765731) 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 as a sum of consecutive naturals, namely, 21382869 + 21382870.
It is an arithmetic number, because the mean of its divisors is an integer number (21382870).
Almost surely, 242765739 is an apocalyptic number.
42765739 is a deficient number, since it is larger than the sum of its proper divisors (1).
42765739 is an equidigital number, since it uses as much as digits as its factorization.
42765739 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 317520, while the sum is 43.
The square root of 42765739 is about 6539.5518959635. The cubic root of 42765739 is about 349.7024382482.
It can be divided in two parts, 427 and 65739, that added together give a palindrome (66166).
The spelling of 42765739 in words is "forty-two million, seven hundred sixty-five thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •