Base | Representation |
---|---|
bin | 11001110100011010101100… |
… | …001000001110001100100101 |
3 | 112220001120202001200221010202 |
4 | 121310122230020032030211 |
5 | 104340424010200124401 |
6 | 1041301345111000245 |
7 | 32626643655455621 |
oct | 3164325410161445 |
9 | 486046661627122 |
10 | 113553233208101 |
11 | 331aa723901525 |
12 | 1089b464069085 |
13 | 4b490407b691b |
14 | 2008011d3c181 |
15 | d1dba81dc06b |
hex | 6746ac20e325 |
113553233208101 has 2 divisors, whose sum is σ = 113553233208102. Its totient is φ = 113553233208100.
The previous prime is 113553233208011. The next prime is 113553233208109. The reversal of 113553233208101 is 101802332355311.
Together with previous prime (113553233208011) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 61767794844001 + 51785438364100 = 7859249^2 + 7196210^2 .
It is a cyclic number.
It is not a de Polignac number, because 113553233208101 - 210 = 113553233207077 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113553233208109) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56776616604050 + 56776616604051.
It is an arithmetic number, because the mean of its divisors is an integer number (56776616604051).
Almost surely, 2113553233208101 is an apocalyptic number.
It is an amenable number.
113553233208101 is a deficient number, since it is larger than the sum of its proper divisors (1).
113553233208101 is an equidigital number, since it uses as much as digits as its factorization.
113553233208101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64800, while the sum is 38.
The spelling of 113553233208101 in words is "one hundred thirteen trillion, five hundred fifty-three billion, two hundred thirty-three million, two hundred eight thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •