Base | Representation |
---|---|
bin | 11001101101111111111100… |
… | …100111101110100101101001 |
3 | 112211111102100211200212221112 |
4 | 121231333330213232211221 |
5 | 104311212242203404113 |
6 | 1040323010033520105 |
7 | 32553041545246316 |
oct | 3155777447564551 |
9 | 484442324625845 |
10 | 113112202013033 |
11 | 3304a685230a63 |
12 | 10829a9b713035 |
13 | 4b16586585c42 |
14 | 1dd093465dd0d |
15 | d124945175a8 |
hex | 66dffc9ee969 |
113112202013033 has 2 divisors, whose sum is σ = 113112202013034. Its totient is φ = 113112202013032.
The previous prime is 113112202013029. The next prime is 113112202013039. The reversal of 113112202013033 is 330310202211311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 65950511064064 + 47161690948969 = 8120992^2 + 6867437^2 .
It is a cyclic number.
It is not a de Polignac number, because 113112202013033 - 22 = 113112202013029 is a prime.
It is not a weakly prime, because it can be changed into another prime (113112202013039) 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 as a sum of consecutive naturals, namely, 56556101006516 + 56556101006517.
It is an arithmetic number, because the mean of its divisors is an integer number (56556101006517).
Almost surely, 2113112202013033 is an apocalyptic number.
It is an amenable number.
113112202013033 is a deficient number, since it is larger than the sum of its proper divisors (1).
113112202013033 is an equidigital number, since it uses as much as digits as its factorization.
113112202013033 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 23.
Adding to 113112202013033 its reverse (330310202211311), we get a palindrome (443422404224344).
The spelling of 113112202013033 in words is "one hundred thirteen trillion, one hundred twelve billion, two hundred two million, thirteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •