Base | Representation |
---|---|
bin | 101100000111011… |
… | …010100011001101 |
3 | 1220120201001221022 |
4 | 230013122203031 |
5 | 3003434010021 |
6 | 201235443525 |
7 | 24225045146 |
oct | 5407324315 |
9 | 1816631838 |
10 | 740141261 |
11 | 34a8770a2 |
12 | 187a565a5 |
13 | ba455312 |
14 | 70426acd |
15 | 44ea11ab |
hex | 2c1da8cd |
740141261 has 2 divisors, whose sum is σ = 740141262. Its totient is φ = 740141260.
The previous prime is 740141249. The next prime is 740141263. The reversal of 740141261 is 162141047.
740141261 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., 401802025 + 338339236 = 20045^2 + 18394^2 .
It is a cyclic number.
It is not a de Polignac number, because 740141261 - 26 = 740141197 is a prime.
Together with 740141263, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 740141261.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (740141263) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 370070630 + 370070631.
It is an arithmetic number, because the mean of its divisors is an integer number (370070631).
Almost surely, 2740141261 is an apocalyptic number.
It is an amenable number.
740141261 is a deficient number, since it is larger than the sum of its proper divisors (1).
740141261 is an equidigital number, since it uses as much as digits as its factorization.
740141261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 26.
The square root of 740141261 is about 27205.5373223908. The cubic root of 740141261 is about 904.5617205673.
The spelling of 740141261 in words is "seven hundred forty million, one hundred forty-one thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •