Base | Representation |
---|---|
bin | 100110001001… |
… | …011110000101 |
3 | 200211001210001 |
4 | 212021132011 |
5 | 10030002021 |
6 | 554201301 |
7 | 151000165 |
oct | 46113605 |
9 | 20731701 |
10 | 10000261 |
11 | 5710387 |
12 | 3423231 |
13 | 20c1a1b |
14 | 14845a5 |
15 | d28091 |
hex | 989785 |
10000261 has 2 divisors, whose sum is σ = 10000262. Its totient is φ = 10000260.
The previous prime is 10000253. The next prime is 10000271. The reversal of 10000261 is 16200001.
It is an a-pointer prime, because the next prime (10000271) can be obtained adding 10000261 to its sum of digits (10).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5377761 + 4622500 = 2319^2 + 2150^2 .
It is a cyclic number.
It is not a de Polignac number, because 10000261 - 23 = 10000253 is a prime.
It is a super-3 number, since 3×100002613 (a number of 22 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10000271) 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, 5000130 + 5000131.
It is an arithmetic number, because the mean of its divisors is an integer number (5000131).
Almost surely, 210000261 is an apocalyptic number.
It is an amenable number.
10000261 is a deficient number, since it is larger than the sum of its proper divisors (1).
10000261 is an equidigital number, since it uses as much as digits as its factorization.
10000261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 10.
The square root of 10000261 is about 3162.3189276226. The cubic root of 10000261 is about 215.4453433451.
Adding to 10000261 its reverse (16200001), we get a palindrome (26200262).
The spelling of 10000261 in words is "ten million, two hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •