Base | Representation |
---|---|
bin | 11001101100110101010110… |
… | …001111000010010101011101 |
3 | 112211012202121110201110120011 |
4 | 121230311112033002111131 |
5 | 104303404220341024013 |
6 | 1040222121433323221 |
7 | 32544204556645141 |
oct | 3154652617022535 |
9 | 484182543643504 |
10 | 113032101111133 |
11 | 33019710377886 |
12 | 10816465b66511 |
13 | 4b0bb5c582c79 |
14 | 1dcaad633b221 |
15 | d10357266c3d |
hex | 66cd563c255d |
113032101111133 has 2 divisors, whose sum is σ = 113032101111134. Its totient is φ = 113032101111132.
The previous prime is 113032101111131. The next prime is 113032101111143. The reversal of 113032101111133 is 331111101230311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 82157219939844 + 30874881171289 = 9064062^2 + 5556517^2 .
It is a cyclic number.
It is not a de Polignac number, because 113032101111133 - 21 = 113032101111131 is a prime.
Together with 113032101111131, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113032101111131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56516050555566 + 56516050555567.
It is an arithmetic number, because the mean of its divisors is an integer number (56516050555567).
Almost surely, 2113032101111133 is an apocalyptic number.
It is an amenable number.
113032101111133 is a deficient number, since it is larger than the sum of its proper divisors (1).
113032101111133 is an equidigital number, since it uses as much as digits as its factorization.
113032101111133 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 162, while the sum is 22.
Adding to 113032101111133 its reverse (331111101230311), we get a palindrome (444143202341444).
The spelling of 113032101111133 in words is "one hundred thirteen trillion, thirty-two billion, one hundred one million, one hundred eleven thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •