Base | Representation |
---|---|
bin | 101000011101… |
… | …011010010101 |
3 | 201221212000022 |
4 | 220131122111 |
5 | 10203344404 |
6 | 1015154525 |
7 | 156102644 |
oct | 50353225 |
9 | 21855008 |
10 | 10606229 |
11 | 5a94687 |
12 | 3675a45 |
13 | 227479a |
14 | 15a135b |
15 | de78be |
hex | a1d695 |
10606229 has 2 divisors, whose sum is σ = 10606230. Its totient is φ = 10606228.
The previous prime is 10606223. The next prime is 10606231. The reversal of 10606229 is 92260601.
10606229 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., 9778129 + 828100 = 3127^2 + 910^2 .
It is a cyclic number.
It is not a de Polignac number, because 10606229 - 24 = 10606213 is a prime.
It is a super-2 number, since 2×106062292 = 224984187200882, which contains 22 as substring.
Together with 10606231, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10606198 and 10606207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10606223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5303114 + 5303115.
It is an arithmetic number, because the mean of its divisors is an integer number (5303115).
Almost surely, 210606229 is an apocalyptic number.
It is an amenable number.
10606229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10606229 is an equidigital number, since it uses as much as digits as its factorization.
10606229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 26.
The square root of 10606229 is about 3256.7205897958. The cubic root of 10606229 is about 219.7119439363.
The spelling of 10606229 in words is "ten million, six hundred six thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •