Base | Representation |
---|---|
bin | 1010001111011… |
… | …0000001011101 |
3 | 2222211010100111 |
4 | 2203312001131 |
5 | 41443410444 |
6 | 4132330021 |
7 | 1031034562 |
oct | 243660135 |
9 | 88733314 |
10 | 42950749 |
11 | 22276596 |
12 | 12473911 |
13 | 8b8a95a |
14 | 59c0869 |
15 | 3b86234 |
hex | 28f605d |
42950749 has 2 divisors, whose sum is σ = 42950750. Its totient is φ = 42950748.
The previous prime is 42950741. The next prime is 42950759. The reversal of 42950749 is 94705924.
42950749 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 39601849 + 3348900 = 6293^2 + 1830^2 .
It is a cyclic number.
It is not a de Polignac number, because 42950749 - 23 = 42950741 is a prime.
It is a super-2 number, since 2×429507492 = 3689533679322002, which contains 22 as substring.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42950741) 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, 21475374 + 21475375.
It is an arithmetic number, because the mean of its divisors is an integer number (21475375).
Almost surely, 242950749 is an apocalyptic number.
It is an amenable number.
42950749 is a deficient number, since it is larger than the sum of its proper divisors (1).
42950749 is an equidigital number, since it uses as much as digits as its factorization.
42950749 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90720, while the sum is 40.
The square root of 42950749 is about 6553.6820948227. The cubic root of 42950749 is about 350.2059984602.
The spelling of 42950749 in words is "forty-two million, nine hundred fifty thousand, seven hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •