Base | Representation |
---|---|
bin | 11001101110101111011000… |
… | …110101111010111010011111 |
3 | 112211200021211220001220011100 |
4 | 121232233120311322322133 |
5 | 104313031103142030221 |
6 | 1040402232432524143 |
7 | 32556524064462636 |
oct | 3156573065727237 |
9 | 484607756056140 |
10 | 113163141361311 |
11 | 3306a2451612a8 |
12 | 108379370b0653 |
13 | 4b1b313b18342 |
14 | 1dd31a7a3051d |
15 | d139765ac926 |
hex | 66ebd8d7ae9f |
113163141361311 has 48 divisors (see below), whose sum is σ = 168953515481088. Its totient is φ = 72912120062400.
The previous prime is 113163141361307. The next prime is 113163141361327.
113163141361311 is a `hidden beast` number, since 1 + 1 + 3 + 1 + 6 + 3 + 14 + 13 + 613 + 11 = 666.
113163141361311 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 113163141361311 - 22 = 113163141361307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (113163141361811) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 839004700 + ... + 839139566.
It is an arithmetic number, because the mean of its divisors is an integer number (3519864905856).
Almost surely, 2113163141361311 is an apocalyptic number.
113163141361311 is a deficient number, since it is larger than the sum of its proper divisors (55790374119777).
113163141361311 is a wasteful number, since it uses less digits than its factorization.
113163141361311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 138852 (or 138849 counting only the distinct ones).
The product of its digits is 11664, while the sum is 36.
The spelling of 113163141361311 in words is "one hundred thirteen trillion, one hundred sixty-three billion, one hundred forty-one million, three hundred sixty-one thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •