Base | Representation |
---|---|
bin | 10100101011010101… |
… | …11101001101011101 |
3 | 1001122122111020221012 |
4 | 22111222331031131 |
5 | 140213324004131 |
6 | 5033312545005 |
7 | 542043643031 |
oct | 122552751535 |
9 | 31578436835 |
10 | 11101000541 |
11 | 4787253014 |
12 | 2199852165 |
13 | 107bb2b697 |
14 | 7744821c1 |
15 | 44e89052b |
hex | 295abd35d |
11101000541 has 2 divisors, whose sum is σ = 11101000542. Its totient is φ = 11101000540.
The previous prime is 11101000511. The next prime is 11101000543. The reversal of 11101000541 is 14500010111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10826402500 + 274598041 = 104050^2 + 16571^2 .
It is a cyclic number.
It is not a de Polignac number, because 11101000541 - 226 = 11033891677 is a prime.
It is a super-2 number, since 2×111010005412 (a number of 21 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 11101000543, it forms a pair of twin primes.
It is a Chen 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 (11101000543) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5550500270 + 5550500271.
It is an arithmetic number, because the mean of its divisors is an integer number (5550500271).
Almost surely, 211101000541 is an apocalyptic number.
It is an amenable number.
11101000541 is a deficient number, since it is larger than the sum of its proper divisors (1).
11101000541 is an equidigital number, since it uses as much as digits as its factorization.
11101000541 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 20, while the sum is 14.
Adding to 11101000541 its reverse (14500010111), we get a palindrome (25601010652).
The spelling of 11101000541 in words is "eleven billion, one hundred one million, five hundred forty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •