Base | Representation |
---|---|
bin | 10101101110110110… |
… | …00011001110110001 |
3 | 1010010010000000201112 |
4 | 22313123003032301 |
5 | 142343304144431 |
6 | 5205421443105 |
7 | 562061020214 |
oct | 126733031661 |
9 | 33103000645 |
10 | 11667256241 |
11 | 4a47953333 |
12 | 2317410495 |
13 | 113c240c24 |
14 | 7c976377b |
15 | 484444c2b |
hex | 2b76c33b1 |
11667256241 has 2 divisors, whose sum is σ = 11667256242. Its totient is φ = 11667256240.
The previous prime is 11667256231. The next prime is 11667256243. The reversal of 11667256241 is 14265276611.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10303062016 + 1364194225 = 101504^2 + 36935^2 .
It is an emirp because it is prime and its reverse (14265276611) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11667256241 - 210 = 11667255217 is a prime.
It is a super-2 number, since 2×116672562412 (a number of 21 digits) contains 22 as substring.
Together with 11667256243, 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 (11667256243) 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, 5833628120 + 5833628121.
It is an arithmetic number, because the mean of its divisors is an integer number (5833628121).
Almost surely, 211667256241 is an apocalyptic number.
It is an amenable number.
11667256241 is a deficient number, since it is larger than the sum of its proper divisors (1).
11667256241 is an equidigital number, since it uses as much as digits as its factorization.
11667256241 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 120960, while the sum is 41.
The spelling of 11667256241 in words is "eleven billion, six hundred sixty-seven million, two hundred fifty-six thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •