Base | Representation |
---|---|
bin | 11001101000111011001011… |
… | …001001001011011100110001 |
3 | 112210021002020202220022120121 |
4 | 121220323023021023130301 |
5 | 104240004101232221400 |
6 | 1035454454413410241 |
7 | 32515615100346511 |
oct | 3150731311133461 |
9 | 483232222808517 |
10 | 112763479570225 |
11 | 32a257a5530300 |
12 | 10792399199981 |
13 | 4abc720595323 |
14 | 1dbbad2749841 |
15 | d0838471e21a |
hex | 668ecb24b731 |
112763479570225 has 27 divisors (see below), whose sum is σ = 153694622909569. Its totient is φ = 82009378563200.
The previous prime is 112763479570193. The next prime is 112763479570319. The reversal of 112763479570225 is 522075974367211.
The square root of 112763479570225 is 10619015.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 40201090627489 + 72562388942736 = 6340433^2 + 8518356^2 .
It is not a de Polignac number, because 112763479570225 - 25 = 112763479570193 is a prime.
It is a Duffinian number.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 583949289 + ... + 584142361.
Almost surely, 2112763479570225 is an apocalyptic number.
112763479570225 is the 10619015-th square number.
112763479570225 is the 5309508-th centered octagonal number.
It is an amenable number.
112763479570225 is a deficient number, since it is larger than the sum of its proper divisors (40931143339344).
112763479570225 is an frugal number, since it uses more digits than its factorization.
112763479570225 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 386178 (or 193089 counting only the distinct ones).
The product of its (nonzero) digits is 44452800, while the sum is 61.
The spelling of 112763479570225 in words is "one hundred twelve trillion, seven hundred sixty-three billion, four hundred seventy-nine million, five hundred seventy thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •