Base | Representation |
---|---|
bin | 11001101100110101010000… |
… | …111000001011001111001001 |
3 | 112211012202101012121010211211 |
4 | 121230311100320023033021 |
5 | 104303404024333412301 |
6 | 1040222104503053121 |
7 | 32544202415665345 |
oct | 3154652070131711 |
9 | 484182335533754 |
10 | 113032011232201 |
11 | 33019674669476 |
12 | 1081643ba411a1 |
13 | 4b0bb46a74179 |
14 | 1dcaac8422625 |
15 | d1034e411051 |
hex | 66cd50e0b3c9 |
113032011232201 has 2 divisors, whose sum is σ = 113032011232202. Its totient is φ = 113032011232200.
The previous prime is 113032011232171. The next prime is 113032011232219. The reversal of 113032011232201 is 102232110230311.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 56673433886976 + 56358577345225 = 7528176^2 + 7507235^2 .
It is a cyclic number.
It is not a de Polignac number, because 113032011232201 - 25 = 113032011232169 is a prime.
It is not a weakly prime, because it can be changed into another prime (113032011232291) 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, 56516005616100 + 56516005616101.
It is an arithmetic number, because the mean of its divisors is an integer number (56516005616101).
Almost surely, 2113032011232201 is an apocalyptic number.
It is an amenable number.
113032011232201 is a deficient number, since it is larger than the sum of its proper divisors (1).
113032011232201 is an equidigital number, since it uses as much as digits as its factorization.
113032011232201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 113032011232201 its reverse (102232110230311), we get a palindrome (215264121462512).
The spelling of 113032011232201 in words is "one hundred thirteen trillion, thirty-two billion, eleven million, two hundred thirty-two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •