Base | Representation |
---|---|
bin | 1010100011011010111011… |
… | …1010001011001001110001 |
3 | 1112002022000200222102111022 |
4 | 2220312232322023021301 |
5 | 3010103224113331423 |
6 | 40402350020225225 |
7 | 2305223021260223 |
oct | 250665672131161 |
9 | 45068020872438 |
10 | 11603641152113 |
11 | 3774092a18a2a |
12 | 1374a43b3b215 |
13 | 6622ac53c72a |
14 | 2c189523c413 |
15 | 151c86016dc8 |
hex | a8daee8b271 |
11603641152113 has 2 divisors, whose sum is σ = 11603641152114. Its totient is φ = 11603641152112.
The previous prime is 11603641152091. The next prime is 11603641152151. The reversal of 11603641152113 is 31125114630611.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10818198544609 + 785442607504 = 3289103^2 + 886252^2 .
It is a cyclic number.
It is not a de Polignac number, because 11603641152113 - 214 = 11603641135729 is a prime.
It is not a weakly prime, because it can be changed into another prime (11603641152713) 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, 5801820576056 + 5801820576057.
It is an arithmetic number, because the mean of its divisors is an integer number (5801820576057).
Almost surely, 211603641152113 is an apocalyptic number.
It is an amenable number.
11603641152113 is a deficient number, since it is larger than the sum of its proper divisors (1).
11603641152113 is an equidigital number, since it uses as much as digits as its factorization.
11603641152113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 35.
Adding to 11603641152113 its reverse (31125114630611), we get a palindrome (42728755782724).
The spelling of 11603641152113 in words is "eleven trillion, six hundred three billion, six hundred forty-one million, one hundred fifty-two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •