Base | Representation |
---|---|
bin | 11100110011001… |
… | …00010010011101 |
3 | 121211120200221012 |
4 | 32121210102131 |
5 | 443321131021 |
6 | 35545545005 |
7 | 5662265243 |
oct | 1631442235 |
9 | 554520835 |
10 | 241583261 |
11 | 114405097 |
12 | 68aa5165 |
13 | 3b08669a |
14 | 24128793 |
15 | 1632035b |
hex | e66449d |
241583261 has 2 divisors, whose sum is σ = 241583262. Its totient is φ = 241583260.
The previous prime is 241583231. The next prime is 241583263. The reversal of 241583261 is 162385142.
241583261 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., 230857636 + 10725625 = 15194^2 + 3275^2 .
It is a cyclic number.
It is not a de Polignac number, because 241583261 - 214 = 241566877 is a prime.
Together with 241583263, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p13243775 and since 241583261 and 13243775 have the same sum of digits, it is a Honaker prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (241583263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 120791630 + 120791631.
It is an arithmetic number, because the mean of its divisors is an integer number (120791631).
Almost surely, 2241583261 is an apocalyptic number.
It is an amenable number.
241583261 is a deficient number, since it is larger than the sum of its proper divisors (1).
241583261 is an equidigital number, since it uses as much as digits as its factorization.
241583261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 11520, while the sum is 32.
The square root of 241583261 is about 15542.9489158268. The cubic root of 241583261 is about 622.8100516174.
The spelling of 241583261 in words is "two hundred forty-one million, five hundred eighty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •