Base | Representation |
---|---|
bin | 11001101110001001010111… |
… | …001010100000001110000101 |
3 | 112211112101110100120022021002 |
4 | 121232021113022200032011 |
5 | 104311343443104411003 |
6 | 1040331401112503045 |
7 | 32553550215320213 |
oct | 3156112712401605 |
9 | 484471410508232 |
10 | 113122311013253 |
11 | 330539a25244a3 |
12 | 1082ba410aaa85 |
13 | 4b17507a18689 |
14 | 1dd1213077cb3 |
15 | d12886c56a88 |
hex | 66e2572a0385 |
113122311013253 has 2 divisors, whose sum is σ = 113122311013254. Its totient is φ = 113122311013252.
The previous prime is 113122311013199. The next prime is 113122311013273. The reversal of 113122311013253 is 352310113221311.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 109638029589124 + 3484281424129 = 10470818^2 + 1866623^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-113122311013253 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (113122311013273) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56561155506626 + 56561155506627.
It is an arithmetic number, because the mean of its divisors is an integer number (56561155506627).
Almost surely, 2113122311013253 is an apocalyptic number.
It is an amenable number.
113122311013253 is a deficient number, since it is larger than the sum of its proper divisors (1).
113122311013253 is an equidigital number, since it uses as much as digits as its factorization.
113122311013253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3240, while the sum is 29.
Adding to 113122311013253 its reverse (352310113221311), we get a palindrome (465432424234564).
The spelling of 113122311013253 in words is "one hundred thirteen trillion, one hundred twenty-two billion, three hundred eleven million, thirteen thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •