Base | Representation |
---|---|
bin | 1010010011110011101111… |
… | …0000101110100100101001 |
3 | 1111010122201000001101021011 |
4 | 2210330323300232210221 |
5 | 2441204420324323221 |
6 | 40035230510343521 |
7 | 2246646210324616 |
oct | 244747360564451 |
9 | 44118630041234 |
10 | 11335421323561 |
11 | 3680363906935 |
12 | 1330a697baba1 |
13 | 642c058428ca |
14 | 2b28ccb3950d |
15 | 149cd88c01e1 |
hex | a4f3bc2e929 |
11335421323561 has 2 divisors, whose sum is σ = 11335421323562. Its totient is φ = 11335421323560.
The previous prime is 11335421323547. The next prime is 11335421323573. The reversal of 11335421323561 is 16532312453311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6413151056400 + 4922270267161 = 2532420^2 + 2218619^2 .
It is a cyclic number.
It is not a de Polignac number, because 11335421323561 - 233 = 11326831388969 is a prime.
It is not a weakly prime, because it can be changed into another prime (11335421323531) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5667710661780 + 5667710661781.
It is an arithmetic number, because the mean of its divisors is an integer number (5667710661781).
Almost surely, 211335421323561 is an apocalyptic number.
It is an amenable number.
11335421323561 is a deficient number, since it is larger than the sum of its proper divisors (1).
11335421323561 is an equidigital number, since it uses as much as digits as its factorization.
11335421323561 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 194400, while the sum is 40.
Adding to 11335421323561 its reverse (16532312453311), we get a palindrome (27867733776872).
The spelling of 11335421323561 in words is "eleven trillion, three hundred thirty-five billion, four hundred twenty-one million, three hundred twenty-three thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •