Base | Representation |
---|---|
bin | 1010000010110011011100… |
… | …1101010011100001100101 |
3 | 1110002201122200001212122201 |
4 | 2200230313031103201211 |
5 | 2421413123002341431 |
6 | 35253114401254501 |
7 | 2216564644000654 |
oct | 240546715234145 |
9 | 43081580055581 |
10 | 11043287152741 |
11 | 3578482777508 |
12 | 12a431a634431 |
13 | 6214ba50b0bc |
14 | 2a26d853719b |
15 | 1423dba57461 |
hex | a0b37353865 |
11043287152741 has 2 divisors, whose sum is σ = 11043287152742. Its totient is φ = 11043287152740.
The previous prime is 11043287152687. The next prime is 11043287152759. The reversal of 11043287152741 is 14725178234011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10081602923716 + 961684229025 = 3175154^2 + 980655^2 .
It is a cyclic number.
It is not a de Polignac number, because 11043287152741 - 225 = 11043253598309 is a prime.
It is a super-2 number, since 2×110432871527412 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11043287152691 and 11043287152700.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11043287152441) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5521643576370 + 5521643576371.
It is an arithmetic number, because the mean of its divisors is an integer number (5521643576371).
Almost surely, 211043287152741 is an apocalyptic number.
It is an amenable number.
11043287152741 is a deficient number, since it is larger than the sum of its proper divisors (1).
11043287152741 is an equidigital number, since it uses as much as digits as its factorization.
11043287152741 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 376320, while the sum is 46.
The spelling of 11043287152741 in words is "eleven trillion, forty-three billion, two hundred eighty-seven million, one hundred fifty-two thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •