Base | Representation |
---|---|
bin | 10100100111000100… |
… | …00011011111110001 |
3 | 1001120010221221212202 |
4 | 22103202003133301 |
5 | 140130132100221 |
6 | 5025551432545 |
7 | 541126622246 |
oct | 122342033761 |
9 | 31503857782 |
10 | 11065112561 |
11 | 4768a70928 |
12 | 2189825755 |
13 | 10745746a9 |
14 | 76d7bd5cd |
15 | 44b651d0b |
hex | 2938837f1 |
11065112561 has 2 divisors, whose sum is σ = 11065112562. Its totient is φ = 11065112560.
The previous prime is 11065112551. The next prime is 11065112563. The reversal of 11065112561 is 16521156011.
11065112561 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11015761936 + 49350625 = 104956^2 + 7025^2 .
It is a cyclic number.
It is not a de Polignac number, because 11065112561 - 226 = 10998003697 is a prime.
Together with 11065112563, 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 (11065112563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5532556280 + 5532556281.
It is an arithmetic number, because the mean of its divisors is an integer number (5532556281).
Almost surely, 211065112561 is an apocalyptic number.
It is an amenable number.
11065112561 is a deficient number, since it is larger than the sum of its proper divisors (1).
11065112561 is an equidigital number, since it uses as much as digits as its factorization.
11065112561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 29.
Adding to 11065112561 its reverse (16521156011), we get a palindrome (27586268572).
The spelling of 11065112561 in words is "eleven billion, sixty-five million, one hundred twelve thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •