Base | Representation |
---|---|
bin | 1010000001101101010000… |
… | …1001101110100110101001 |
3 | 1110000221000112222202000122 |
4 | 2200123110021232212221 |
5 | 2421111031010322023 |
6 | 35240321005213025 |
7 | 2215330014521435 |
oct | 240332411564651 |
9 | 43027015882018 |
10 | 11024445401513 |
11 | 3570494027985 |
12 | 12a0740561175 |
13 | 61c7a6a99c8b |
14 | 2a182bdd39c5 |
15 | 141b8782b2c8 |
hex | a06d426e9a9 |
11024445401513 has 2 divisors, whose sum is σ = 11024445401514. Its totient is φ = 11024445401512.
The previous prime is 11024445401447. The next prime is 11024445401521. The reversal of 11024445401513 is 31510454442011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8627190835264 + 2397254566249 = 2937208^2 + 1548307^2 .
It is a cyclic number.
It is not a de Polignac number, because 11024445401513 - 28 = 11024445401257 is a prime.
It is a super-2 number, since 2×110244454015132 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11024445401813) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5512222700756 + 5512222700757.
It is an arithmetic number, because the mean of its divisors is an integer number (5512222700757).
Almost surely, 211024445401513 is an apocalyptic number.
It is an amenable number.
11024445401513 is a deficient number, since it is larger than the sum of its proper divisors (1).
11024445401513 is an equidigital number, since it uses as much as digits as its factorization.
11024445401513 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 38400, while the sum is 35.
Adding to 11024445401513 its reverse (31510454442011), we get a palindrome (42534899843524).
The spelling of 11024445401513 in words is "eleven trillion, twenty-four billion, four hundred forty-five million, four hundred one thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •