Base | Representation |
---|---|
bin | 1010000011010101111111… |
… | …1111100001100001001001 |
3 | 1110010121121000002102112211 |
4 | 2200311133333201201021 |
5 | 2422041121200343424 |
6 | 35301250535305121 |
7 | 2220343526204134 |
oct | 240653777414111 |
9 | 43117530072484 |
10 | 11052561340489 |
11 | 3581401811a89 |
12 | 12a608851b1a1 |
13 | 622337a1c366 |
14 | 2a2d3812321b |
15 | 142780d44b94 |
hex | a0d5ffe1849 |
11052561340489 has 2 divisors, whose sum is σ = 11052561340490. Its totient is φ = 11052561340488.
The previous prime is 11052561340441. The next prime is 11052561340519. The reversal of 11052561340489 is 98404316525011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10754903804089 + 297657536400 = 3279467^2 + 545580^2 .
It is a cyclic number.
It is not a de Polignac number, because 11052561340489 - 233 = 11043971405897 is a prime.
It is a super-2 number, since 2×110525613404892 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (11052561350489) 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, 5526280670244 + 5526280670245.
It is an arithmetic number, because the mean of its divisors is an integer number (5526280670245).
Almost surely, 211052561340489 is an apocalyptic number.
It is an amenable number.
11052561340489 is a deficient number, since it is larger than the sum of its proper divisors (1).
11052561340489 is an equidigital number, since it uses as much as digits as its factorization.
11052561340489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1036800, while the sum is 49.
The spelling of 11052561340489 in words is "eleven trillion, fifty-two billion, five hundred sixty-one million, three hundred forty thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •