Base | Representation |
---|---|
bin | 10101100010101101… |
… | …11001101011011001 |
3 | 1002212000112112120222 |
4 | 22301112321223121 |
5 | 142141232131431 |
6 | 5151344525425 |
7 | 556414113113 |
oct | 126126715331 |
9 | 32760475528 |
10 | 11565505241 |
11 | 49a54762a4 |
12 | 22a9320875 |
13 | 1124136434 |
14 | 7ba0383b3 |
15 | 47a54657b |
hex | 2b15b9ad9 |
11565505241 has 2 divisors, whose sum is σ = 11565505242. Its totient is φ = 11565505240.
The previous prime is 11565505223. The next prime is 11565505243. The reversal of 11565505241 is 14250556511.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10978848400 + 586656841 = 104780^2 + 24221^2 .
It is an emirp because it is prime and its reverse (14250556511) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11565505241 is a prime.
It is a super-2 number, since 2×115655052412 (a number of 21 digits) contains 22 as substring.
Together with 11565505243, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (11565505243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5782752620 + 5782752621.
It is an arithmetic number, because the mean of its divisors is an integer number (5782752621).
Almost surely, 211565505241 is an apocalyptic number.
It is an amenable number.
11565505241 is a deficient number, since it is larger than the sum of its proper divisors (1).
11565505241 is an equidigital number, since it uses as much as digits as its factorization.
11565505241 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30000, while the sum is 35.
The spelling of 11565505241 in words is "eleven billion, five hundred sixty-five million, five hundred five thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •