Base | Representation |
---|---|
bin | 1010000101100011000111… |
… | …1110000011001001000011 |
3 | 1110021020101002211020020212 |
4 | 2201120301332003021003 |
5 | 2423201212120021101 |
6 | 35330513554224335 |
7 | 2223154352543303 |
oct | 241306176031103 |
9 | 43236332736225 |
10 | 11090443907651 |
11 | 3596481505429 |
12 | 12b149b2850ab |
13 | 625a941bbc84 |
14 | 2a4acd3c7603 |
15 | 14374b9be1bb |
hex | a1631f83243 |
11090443907651 has 2 divisors, whose sum is σ = 11090443907652. Its totient is φ = 11090443907650.
The previous prime is 11090443907639. The next prime is 11090443907707. The reversal of 11090443907651 is 15670934409011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11090443907651 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11090443907651.
It is not a weakly prime, because it can be changed into another prime (11090443907351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5545221953825 + 5545221953826.
It is an arithmetic number, because the mean of its divisors is an integer number (5545221953826).
Almost surely, 211090443907651 is an apocalyptic number.
11090443907651 is a deficient number, since it is larger than the sum of its proper divisors (1).
11090443907651 is an equidigital number, since it uses as much as digits as its factorization.
11090443907651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 816480, while the sum is 50.
The spelling of 11090443907651 in words is "eleven trillion, ninety billion, four hundred forty-three million, nine hundred seven thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •