Base | Representation |
---|---|
bin | 10100011111111010… |
… | …01000010000000101 |
3 | 1001101222001001120121 |
4 | 22033331020100011 |
5 | 140014301213221 |
6 | 5020005301541 |
7 | 536500546513 |
oct | 121775102005 |
9 | 31358031517 |
10 | 11005101061 |
11 | 4738102349 |
12 | 21717048b1 |
13 | 1064cc2426 |
14 | 76583b4b3 |
15 | 44624aa41 |
hex | 28ff48405 |
11005101061 has 2 divisors, whose sum is σ = 11005101062. Its totient is φ = 11005101060.
The previous prime is 11005101049. The next prime is 11005101119. The reversal of 11005101061 is 16010150011.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7042398561 + 3962702500 = 83919^2 + 62950^2 .
It is a cyclic number.
It is not a de Polignac number, because 11005101061 - 27 = 11005100933 is a prime.
It is a super-2 number, since 2×110051010612 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11005101661) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5502550530 + 5502550531.
It is an arithmetic number, because the mean of its divisors is an integer number (5502550531).
Almost surely, 211005101061 is an apocalyptic number.
It is an amenable number.
11005101061 is a deficient number, since it is larger than the sum of its proper divisors (1).
11005101061 is an equidigital number, since it uses as much as digits as its factorization.
11005101061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 30, while the sum is 16.
Adding to 11005101061 its reverse (16010150011), we get a palindrome (27015251072).
The spelling of 11005101061 in words is "eleven billion, five million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •