Base | Representation |
---|---|
bin | 1010000100000010011110… |
… | …0111100000010000001001 |
3 | 1110011202102001120120221122 |
4 | 2201000213213200100021 |
5 | 2422240044101443031 |
6 | 35310543351245025 |
7 | 2221245430545662 |
oct | 241004747402011 |
9 | 43152361516848 |
10 | 11064500421641 |
11 | 35864790453a7 |
12 | 12a845a979775 |
13 | 6234bb374914 |
14 | 2a374ba04369 |
15 | 142c2e08047b |
hex | a10279e0409 |
11064500421641 has 2 divisors, whose sum is σ = 11064500421642. Its totient is φ = 11064500421640.
The previous prime is 11064500421619. The next prime is 11064500421649. The reversal of 11064500421641 is 14612400546011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8529781695241 + 2534718726400 = 2920579^2 + 1592080^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11064500421641 is a prime.
It is a super-2 number, since 2×110645004216412 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11064500421649) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5532250210820 + 5532250210821.
It is an arithmetic number, because the mean of its divisors is an integer number (5532250210821).
Almost surely, 211064500421641 is an apocalyptic number.
It is an amenable number.
11064500421641 is a deficient number, since it is larger than the sum of its proper divisors (1).
11064500421641 is an equidigital number, since it uses as much as digits as its factorization.
11064500421641 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23040, while the sum is 35.
Adding to 11064500421641 its reverse (14612400546011), we get a palindrome (25676900967652).
The spelling of 11064500421641 in words is "eleven trillion, sixty-four billion, five hundred million, four hundred twenty-one thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •