Base | Representation |
---|---|
bin | 1001011111110100011000… |
… | …0001010010101010000101 |
3 | 1100222021020200021011020012 |
4 | 2113331012001102222011 |
5 | 2332041202000142021 |
6 | 34113033212120005 |
7 | 2125266306353654 |
oct | 227750601225205 |
9 | 40867220234205 |
10 | 10442240240261 |
11 | 3366590429095 |
12 | 1207939166005 |
13 | 5a99119c976b |
14 | 28159b21319b |
15 | 13195ed3d35b |
hex | 97f46052a85 |
10442240240261 has 2 divisors, whose sum is σ = 10442240240262. Its totient is φ = 10442240240260.
The previous prime is 10442240240203. The next prime is 10442240240279. The reversal of 10442240240261 is 16204204224401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8755148388100 + 1687091852161 = 2958910^2 + 1298881^2 .
It is a cyclic number.
It is not a de Polignac number, because 10442240240261 - 242 = 6044193729157 is a prime.
It is a super-2 number, since 2×104422402402612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10442240240461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5221120120130 + 5221120120131.
It is an arithmetic number, because the mean of its divisors is an integer number (5221120120131).
Almost surely, 210442240240261 is an apocalyptic number.
It is an amenable number.
10442240240261 is a deficient number, since it is larger than the sum of its proper divisors (1).
10442240240261 is an equidigital number, since it uses as much as digits as its factorization.
10442240240261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 10442240240261 its reverse (16204204224401), we get a palindrome (26646444464662).
The spelling of 10442240240261 in words is "ten trillion, four hundred forty-two billion, two hundred forty million, two hundred forty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •