Base | Representation |
---|---|
bin | 1001110001100… |
… | …1110101000101 |
3 | 2212011000210012 |
4 | 2130121311011 |
5 | 40444002021 |
6 | 4022440005 |
7 | 1005332201 |
oct | 234316505 |
9 | 85130705 |
10 | 41000261 |
11 | 21164115 |
12 | 11893005 |
13 | 8656c13 |
14 | 5633b01 |
15 | 38ed35b |
hex | 2719d45 |
41000261 has 2 divisors, whose sum is σ = 41000262. Its totient is φ = 41000260.
The previous prime is 41000227. The next prime is 41000263. The reversal of 41000261 is 16200014.
41000261 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., 38130625 + 2869636 = 6175^2 + 1694^2 .
It is a cyclic number.
It is not a de Polignac number, because 41000261 - 210 = 40999237 is a prime.
Together with 41000263, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (41000263) 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, 20500130 + 20500131.
It is an arithmetic number, because the mean of its divisors is an integer number (20500131).
Almost surely, 241000261 is an apocalyptic number.
It is an amenable number.
41000261 is a deficient number, since it is larger than the sum of its proper divisors (1).
41000261 is an equidigital number, since it uses as much as digits as its factorization.
41000261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 41000261 is about 6403.1446180763. The cubic root of 41000261 is about 344.8224557316.
Adding to 41000261 its reverse (16200014), we get a palindrome (57200275).
The spelling of 41000261 in words is "forty-one million, two hundred sixty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •