Base | Representation |
---|---|
bin | 1000100110110010011101 |
3 | 11020121200122 |
4 | 20212302131 |
5 | 1034143104 |
6 | 120204325 |
7 | 25114226 |
oct | 10466235 |
9 | 4217618 |
10 | 2256029 |
11 | 1300a96 |
12 | 9096a5 |
13 | 60cb39 |
14 | 42a24d |
15 | 2e86be |
hex | 226c9d |
2256029 has 2 divisors, whose sum is σ = 2256030. Its totient is φ = 2256028.
The previous prime is 2256017. The next prime is 2256031. The reversal of 2256029 is 9206522.
2256029 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 can be written as a sum of positive squares in only one way, i.e., 2256004 + 25 = 1502^2 + 5^2 .
It is a cyclic number.
It is not a de Polignac number, because 2256029 - 24 = 2256013 is a prime.
It is a Sophie Germain prime.
Together with 2256031, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 2255989 and 2256007.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2256049) 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, 1128014 + 1128015.
It is an arithmetic number, because the mean of its divisors is an integer number (1128015).
22256029 is an apocalyptic number.
It is an amenable number.
2256029 is a deficient number, since it is larger than the sum of its proper divisors (1).
2256029 is an equidigital number, since it uses as much as digits as its factorization.
2256029 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 2256029 is about 1502.0083222140. The cubic root of 2256029 is about 131.1540056964.
The spelling of 2256029 in words is "two million, two hundred fifty-six thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •