Base | Representation |
---|---|
bin | 11110010111001100000… |
… | …00111111001110000101 |
3 | 10200201210021012010012002 |
4 | 33023212000333032011 |
5 | 114043024210314021 |
6 | 2115131445235045 |
7 | 135241326034256 |
oct | 17134600771605 |
9 | 3621707163162 |
10 | 1043241104261 |
11 | 3724884515a4 |
12 | 14a22b402a85 |
13 | 774b997bc75 |
14 | 386c925cb2d |
15 | 1c20ca6a50b |
hex | f2e603f385 |
1043241104261 has 2 divisors, whose sum is σ = 1043241104262. Its totient is φ = 1043241104260.
The previous prime is 1043241104237. The next prime is 1043241104357. The reversal of 1043241104261 is 1624011423401.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1043114968900 + 126135361 = 1021330^2 + 11231^2 .
It is a cyclic number.
It is not a de Polignac number, because 1043241104261 - 238 = 768363197317 is a prime.
It is a super-2 number, since 2×10432411042612 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1043241104461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 521620552130 + 521620552131.
It is an arithmetic number, because the mean of its divisors is an integer number (521620552131).
Almost surely, 21043241104261 is an apocalyptic number.
It is an amenable number.
1043241104261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1043241104261 is an equidigital number, since it uses as much as digits as its factorization.
1043241104261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 1043241104261 its reverse (1624011423401), we get a palindrome (2667252527662).
The spelling of 1043241104261 in words is "one trillion, forty-three billion, two hundred forty-one million, one hundred four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •