Base | Representation |
---|---|
bin | 11001011110001011110111… |
… | …100101010111111111111101 |
3 | 112200122112101001210122022122 |
4 | 121132023313211113333331 |
5 | 104140411201120044003 |
6 | 1034131444444452325 |
7 | 32411401044231104 |
oct | 3136136745277775 |
9 | 480575331718278 |
10 | 112025490784253 |
11 | 3277082005a522 |
12 | 1069335a24a0a5 |
13 | 4a67c5c948507 |
14 | 1d940c401103b |
15 | ce409050a238 |
hex | 65e2f7957ffd |
112025490784253 has 2 divisors, whose sum is σ = 112025490784254. Its totient is φ = 112025490784252.
The previous prime is 112025490784247. The next prime is 112025490784313. The reversal of 112025490784253 is 352487094520211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 94128842808004 + 17896647976249 = 9702002^2 + 4230443^2 .
It is a cyclic number.
It is not a de Polignac number, because 112025490784253 - 234 = 112008310915069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 112025490784195 and 112025490784204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112025490784243) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56012745392126 + 56012745392127.
It is an arithmetic number, because the mean of its divisors is an integer number (56012745392127).
Almost surely, 2112025490784253 is an apocalyptic number.
It is an amenable number.
112025490784253 is a deficient number, since it is larger than the sum of its proper divisors (1).
112025490784253 is an equidigital number, since it uses as much as digits as its factorization.
112025490784253 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4838400, while the sum is 53.
The spelling of 112025490784253 in words is "one hundred twelve trillion, twenty-five billion, four hundred ninety million, seven hundred eighty-four thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •