Base | Representation |
---|---|
bin | 110100101101111101… |
… | …1010110010010000001 |
3 | 101211012220021201210021 |
4 | 1221123323112102001 |
5 | 3323324111342423 |
6 | 124001505533441 |
7 | 11115325212061 |
oct | 1513373262201 |
9 | 354186251707 |
10 | 113211434113 |
11 | 440159a3098 |
12 | 19b36344281 |
13 | a8a293cc8b |
14 | 569d9073a1 |
15 | 2e2900395d |
hex | 1a5bed6481 |
113211434113 has 2 divisors, whose sum is σ = 113211434114. Its totient is φ = 113211434112.
The previous prime is 113211434059. The next prime is 113211434117. The reversal of 113211434113 is 311434112311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109413423729 + 3798010384 = 330777^2 + 61628^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113211434113 is a prime.
It is not a weakly prime, because it can be changed into another prime (113211434117) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56605717056 + 56605717057.
It is an arithmetic number, because the mean of its divisors is an integer number (56605717057).
Almost surely, 2113211434113 is an apocalyptic number.
It is an amenable number.
113211434113 is a deficient number, since it is larger than the sum of its proper divisors (1).
113211434113 is an equidigital number, since it uses as much as digits as its factorization.
113211434113 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 25.
Adding to 113211434113 its reverse (311434112311), we get a palindrome (424645546424).
The spelling of 113211434113 in words is "one hundred thirteen billion, two hundred eleven million, four hundred thirty-four thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •