Base | Representation |
---|---|
bin | 101000100111… |
… | …111000110101 |
3 | 202001000212122 |
4 | 220213320311 |
5 | 10211233031 |
6 | 1020125325 |
7 | 156342026 |
oct | 50477065 |
9 | 22030778 |
10 | 10649141 |
11 | 6013948 |
12 | 3696845 |
13 | 228b189 |
14 | 15b2c4d |
15 | e0547b |
hex | a27e35 |
10649141 has 2 divisors, whose sum is σ = 10649142. Its totient is φ = 10649140.
The previous prime is 10649129. The next prime is 10649173. The reversal of 10649141 is 14194601.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10080625 + 568516 = 3175^2 + 754^2 .
It is a cyclic number.
It is not a de Polignac number, because 10649141 - 210 = 10648117 is a prime.
It is a super-2 number, since 2×106491412 = 226808408075762, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Chen prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 10649141.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10649341) 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, 5324570 + 5324571.
It is an arithmetic number, because the mean of its divisors is an integer number (5324571).
Almost surely, 210649141 is an apocalyptic number.
It is an amenable number.
10649141 is a deficient number, since it is larger than the sum of its proper divisors (1).
10649141 is an equidigital number, since it uses as much as digits as its factorization.
10649141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 26.
The square root of 10649141 is about 3263.3021619213. The cubic root of 10649141 is about 220.0078578461.
The spelling of 10649141 in words is "ten million, six hundred forty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •