Base | Representation |
---|---|
bin | 100000101001100… |
… | …1010000111111001 |
3 | 2211100110021001112 |
4 | 1001103022013321 |
5 | 4220424304431 |
6 | 300413130105 |
7 | 36101642534 |
oct | 10123120771 |
9 | 2740407045 |
10 | 1095541241 |
11 | 51244a393 |
12 | 266a89935 |
13 | 145c7c372 |
14 | a56dba1b |
15 | 662a4c2b |
hex | 414ca1f9 |
1095541241 has 2 divisors, whose sum is σ = 1095541242. Its totient is φ = 1095541240.
The previous prime is 1095541219. The next prime is 1095541247. The reversal of 1095541241 is 1421455901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 547794025 + 547747216 = 23405^2 + 23404^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1095541241 is a prime.
It is a super-2 number, since 2×10955412412 = 2400421221463640162, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 1095541198 and 1095541207.
It is not a weakly prime, because it can be changed into another prime (1095541247) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 547770620 + 547770621.
It is an arithmetic number, because the mean of its divisors is an integer number (547770621).
Almost surely, 21095541241 is an apocalyptic number.
1095541241 is the 23405-th centered square number.
It is an amenable number.
1095541241 is a deficient number, since it is larger than the sum of its proper divisors (1).
1095541241 is an equidigital number, since it uses as much as digits as its factorization.
1095541241 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 7200, while the sum is 32.
The square root of 1095541241 is about 33098.9613281142. The cubic root of 1095541241 is about 1030.8834726777.
The spelling of 1095541241 in words is "one billion, ninety-five million, five hundred forty-one thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •