Base | Representation |
---|---|
bin | 1010001011101… |
… | …1000000101001 |
3 | 2222100211210001 |
4 | 2202323000221 |
5 | 41413142113 |
6 | 4123223001 |
7 | 1026010063 |
oct | 242730051 |
9 | 88324701 |
10 | 42709033 |
11 | 22120a24 |
12 | 12377a61 |
13 | 8b04923 |
14 | 595a733 |
15 | 3b397dd |
hex | 28bb029 |
42709033 has 2 divisors, whose sum is σ = 42709034. Its totient is φ = 42709032.
The previous prime is 42708983. The next prime is 42709039. The reversal of 42709033 is 33090724.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 42614784 + 94249 = 6528^2 + 307^2 .
It is a cyclic number.
It is not a de Polignac number, because 42709033 - 29 = 42708521 is a prime.
It is a super-3 number, since 3×427090333 (a number of 24 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 42708992 and 42709010.
It is not a weakly prime, because it can be changed into another prime (42709039) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21354516 + 21354517.
It is an arithmetic number, because the mean of its divisors is an integer number (21354517).
Almost surely, 242709033 is an apocalyptic number.
It is an amenable number.
42709033 is a deficient number, since it is larger than the sum of its proper divisors (1).
42709033 is an equidigital number, since it uses as much as digits as its factorization.
42709033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4536, while the sum is 28.
The square root of 42709033 is about 6535.2148396208. The cubic root of 42709033 is about 349.5478051381.
Adding to 42709033 its reverse (33090724), we get a palindrome (75799757).
The spelling of 42709033 in words is "forty-two million, seven hundred nine thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •