Base | Representation |
---|---|
bin | 101000000001… |
… | …000100100101 |
3 | 201201221210001 |
4 | 220001010211 |
5 | 10141141044 |
6 | 1012501301 |
7 | 155110345 |
oct | 50010445 |
9 | 21657701 |
10 | 10490149 |
11 | 5a1544a |
12 | 361a831 |
13 | 22339b7 |
14 | 1570d25 |
15 | dc32d4 |
hex | a01125 |
10490149 has 2 divisors, whose sum is σ = 10490150. Its totient is φ = 10490148.
The previous prime is 10490119. The next prime is 10490159. The reversal of 10490149 is 94109401.
10490149 is digitally balanced in base 3, 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., 9345249 + 1144900 = 3057^2 + 1070^2 .
It is a cyclic number.
It is not a de Polignac number, because 10490149 - 29 = 10489637 is a prime.
It is a super-3 number, since 3×104901493 (a number of 22 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10490119) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5245074 + 5245075.
It is an arithmetic number, because the mean of its divisors is an integer number (5245075).
Almost surely, 210490149 is an apocalyptic number.
It is an amenable number.
10490149 is a deficient number, since it is larger than the sum of its proper divisors (1).
10490149 is an equidigital number, since it uses as much as digits as its factorization.
10490149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 28.
The square root of 10490149 is about 3238.8499502138. The cubic root of 10490149 is about 218.9074551816.
The spelling of 10490149 in words is "ten million, four hundred ninety thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •