Base | Representation |
---|---|
bin | 1010100011111101111100… |
… | …1011110101110010100001 |
3 | 1112010012021210111101211111 |
4 | 2220333133023311302201 |
5 | 3010232002000233121 |
6 | 40410542444143321 |
7 | 2306004661001053 |
oct | 250773713656241 |
9 | 45105253441744 |
10 | 11613041024161 |
11 | 37780769a7a25 |
12 | 1376827b37b41 |
13 | 663149ab7cb5 |
14 | 2c21077c38d3 |
15 | 15213637e2e1 |
hex | a8fdf2f5ca1 |
11613041024161 has 8 divisors (see below), whose sum is σ = 11632202038440. Its totient is φ = 11593880716032.
The previous prime is 11613041024089. The next prime is 11613041024171. The reversal of 11613041024161 is 16142014031611.
It can be written as a sum of positive squares in 4 ways, for example, as 218574950400 + 11394466073761 = 467520^2 + 3375569^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11613041024161 - 225 = 11613007469729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (11613041024171) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40420905 + ... + 40707193.
It is an arithmetic number, because the mean of its divisors is an integer number (1454025254805).
Almost surely, 211613041024161 is an apocalyptic number.
It is an amenable number.
11613041024161 is a deficient number, since it is larger than the sum of its proper divisors (19161014279).
11613041024161 is an equidigital number, since it uses as much as digits as its factorization.
11613041024161 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 353075.
The product of its (nonzero) digits is 3456, while the sum is 31.
Adding to 11613041024161 its reverse (16142014031611), we get a palindrome (27755055055772).
The spelling of 11613041024161 in words is "eleven trillion, six hundred thirteen billion, forty-one million, twenty-four thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •