Base | Representation |
---|---|
bin | 10100101101111111… |
… | …01110101011110001 |
3 | 1001201012022021210122 |
4 | 22112333232223301 |
5 | 140240021121111 |
6 | 5035425140025 |
7 | 542433560252 |
oct | 122677565361 |
9 | 31635267718 |
10 | 11123223281 |
11 | 4798851315 |
12 | 21a518a615 |
13 | 108360c731 |
14 | 7773c8b29 |
15 | 4517cecdb |
hex | 296feeaf1 |
11123223281 has 2 divisors, whose sum is σ = 11123223282. Its totient is φ = 11123223280.
The previous prime is 11123223253. The next prime is 11123223283. The reversal of 11123223281 is 18232232111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6094144225 + 5029079056 = 78065^2 + 70916^2 .
It is a cyclic number.
It is not a de Polignac number, because 11123223281 - 26 = 11123223217 is a prime.
It is a super-2 number, since 2×111232232812 (a number of 21 digits) contains 22 as substring.
Together with 11123223283, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11123223281.
It is not a weakly prime, because it can be changed into another prime (11123223283) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5561611640 + 5561611641.
It is an arithmetic number, because the mean of its divisors is an integer number (5561611641).
Almost surely, 211123223281 is an apocalyptic number.
It is an amenable number.
11123223281 is a deficient number, since it is larger than the sum of its proper divisors (1).
11123223281 is an equidigital number, since it uses as much as digits as its factorization.
11123223281 is an evil number, because the sum of its binary digits is even.
The product of its digits is 1152, while the sum is 26.
Adding to 11123223281 its reverse (18232232111), we get a palindrome (29355455392).
The spelling of 11123223281 in words is "eleven billion, one hundred twenty-three million, two hundred twenty-three thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •