Base | Representation |
---|---|
bin | 1010001011100… |
… | …1100010111001 |
3 | 2222100112112211 |
4 | 2202321202321 |
5 | 41412444113 |
6 | 4123135121 |
7 | 1025653432 |
oct | 242714271 |
9 | 88315484 |
10 | 42703033 |
11 | 2211746a |
12 | 123744a1 |
13 | 8b01c89 |
14 | 5958489 |
15 | 3b37b3d |
hex | 28b98b9 |
42703033 has 2 divisors, whose sum is σ = 42703034. Its totient is φ = 42703032.
The previous prime is 42703009. The next prime is 42703061. The reversal of 42703033 is 33030724.
42703033 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., 25130169 + 17572864 = 5013^2 + 4192^2 .
It is a cyclic number.
It is not a de Polignac number, because 42703033 - 221 = 40605881 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42702995 and 42703013.
It is not a weakly prime, because it can be changed into another prime (42703093) 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, 21351516 + 21351517.
It is an arithmetic number, because the mean of its divisors is an integer number (21351517).
Almost surely, 242703033 is an apocalyptic number.
It is an amenable number.
42703033 is a deficient number, since it is larger than the sum of its proper divisors (1).
42703033 is an equidigital number, since it uses as much as digits as its factorization.
42703033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 22.
The square root of 42703033 is about 6534.7557720239. The cubic root of 42703033 is about 349.5314355718.
Adding to 42703033 its reverse (33030724), we get a palindrome (75733757).
The spelling of 42703033 in words is "forty-two million, seven hundred three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •