Base | Representation |
---|---|
bin | 1010000000111111110111… |
… | …0111001000000000011101 |
3 | 1102222202120100111201111211 |
4 | 2200033331313020000131 |
5 | 2420411102112003023 |
6 | 35230543523344421 |
7 | 2214416034550156 |
oct | 240177567100035 |
9 | 42882510451454 |
10 | 11012260266013 |
11 | 3566300916266 |
12 | 129a2bb822111 |
13 | 61b5b4483c26 |
14 | 2a0dd398292d |
15 | 1416c2bdaa0d |
hex | a03fddc801d |
11012260266013 has 2 divisors, whose sum is σ = 11012260266014. Its totient is φ = 11012260266012.
The previous prime is 11012260265989. The next prime is 11012260266017. The reversal of 11012260266013 is 31066206221011.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7072424316409 + 3939835949604 = 2659403^2 + 1984902^2 .
It is a cyclic number.
It is not a de Polignac number, because 11012260266013 - 237 = 10874821312541 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11012260266017) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506130133006 + 5506130133007.
It is an arithmetic number, because the mean of its divisors is an integer number (5506130133007).
Almost surely, 211012260266013 is an apocalyptic number.
It is an amenable number.
11012260266013 is a deficient number, since it is larger than the sum of its proper divisors (1).
11012260266013 is an equidigital number, since it uses as much as digits as its factorization.
11012260266013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
Adding to 11012260266013 its reverse (31066206221011), we get a palindrome (42078466487024).
The spelling of 11012260266013 in words is "eleven trillion, twelve billion, two hundred sixty million, two hundred sixty-six thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.176 sec. • engine limits •