Base | Representation |
---|---|
bin | 10000001010111110100101 |
3 | 21222101011222 |
4 | 100022332211 |
5 | 2041124034 |
6 | 230510125 |
7 | 51014246 |
oct | 20127645 |
9 | 7871158 |
10 | 4239269 |
11 | 2436031 |
12 | 1505345 |
13 | b55758 |
14 | 7c4ccd |
15 | 58b12e |
hex | 40afa5 |
4239269 has 2 divisors, whose sum is σ = 4239270. Its totient is φ = 4239268.
The previous prime is 4239251. The next prime is 4239271. The reversal of 4239269 is 9629324.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2362369 + 1876900 = 1537^2 + 1370^2 .
It is a cyclic number.
It is not a de Polignac number, because 4239269 - 28 = 4239013 is a prime.
It is a super-2 number, since 2×42392692 = 35942803308722, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 4239271, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is equal to p298871 and since 4239269 and 298871 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4239229) 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, 2119634 + 2119635.
It is an arithmetic number, because the mean of its divisors is an integer number (2119635).
Almost surely, 24239269 is an apocalyptic number.
It is an amenable number.
4239269 is a deficient number, since it is larger than the sum of its proper divisors (1).
4239269 is an equidigital number, since it uses as much as digits as its factorization.
4239269 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 23328, while the sum is 35.
The square root of 4239269 is about 2058.9485180548. The cubic root of 4239269 is about 161.8441446733.
The spelling of 4239269 in words is "four million, two hundred thirty-nine thousand, two hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.126 sec. • engine limits •