Base | Representation |
---|---|
bin | 10100100101010100… |
… | …00001100101000001 |
3 | 1001112010022201211201 |
4 | 22102222001211001 |
5 | 140112402042031 |
6 | 5024304541201 |
7 | 540561026314 |
oct | 122252014501 |
9 | 31463281751 |
10 | 11050424641 |
11 | 4760749653 |
12 | 2184921801 |
13 | 1071501109 |
14 | 76b87897b |
15 | 44a1eed61 |
hex | 292a81941 |
11050424641 has 9 divisors (see below), whose sum is σ = 11421757089. Its totient is φ = 10690805700.
The previous prime is 11050424633. The next prime is 11050424659. The reversal of 11050424641 is 14642405011.
The square root of 11050424641 is 105121.
It is a perfect power (a square), and thus also a powerful number.
It is not a de Polignac number, because 11050424641 - 23 = 11050424633 is a prime.
It is a super-2 number, since 2×110504246412 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11050424611) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3257056 + ... + 3260446.
It is an arithmetic number, because the mean of its divisors is an integer number (1269084121).
Almost surely, 211050424641 is an apocalyptic number.
11050424641 is the 105121-st square number.
11050424641 is the 52561-st centered octagonal number.
It is an amenable number.
11050424641 is a deficient number, since it is larger than the sum of its proper divisors (371332448).
11050424641 is an frugal number, since it uses more digits than its factorization.
11050424641 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6844 (or 3422 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 28.
Adding to 11050424641 its reverse (14642405011), we get a palindrome (25692829652).
The spelling of 11050424641 in words is "eleven billion, fifty million, four hundred twenty-four thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •