Base | Representation |
---|---|
bin | 110100111010001000… |
… | …0001101010100101001 |
3 | 101212021100020110020211 |
4 | 1221310100031110221 |
5 | 3330143101240000 |
6 | 124110205221121 |
7 | 11131412200522 |
oct | 1516420152451 |
9 | 355240213224 |
10 | 113619555625 |
11 | 442053058a4 |
12 | 1a02ab617a1 |
13 | a9393660b4 |
14 | 56dbbc3849 |
15 | 2e4ec6d7ba |
hex | 1a7440d529 |
113619555625 has 45 divisors (see below), whose sum is σ = 144497282787. Its totient is φ = 89311392000.
The previous prime is 113619555611. The next prime is 113619555629. The reversal of 113619555625 is 526555916311.
The square root of 113619555625 is 337075.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 7 ways, for example, as 92074012969 + 21545542656 = 303437^2 + 146784^2 .
It is not a de Polignac number, because 113619555625 - 227 = 113485337897 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (113619555629) by changing a digit.
It is a polite number, since it can be written in 44 ways as a sum of consecutive naturals, for example, 817406806 + ... + 817406944.
Almost surely, 2113619555625 is an apocalyptic number.
113619555625 is the 337075-th square number.
113619555625 is the 168538-th centered octagonal number.
It is an amenable number.
113619555625 is a deficient number, since it is larger than the sum of its proper divisors (30877727162).
113619555625 is an frugal number, since it uses more digits than its factorization.
113619555625 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 492 (or 241 counting only the distinct ones).
The product of its digits is 1215000, while the sum is 49.
Multiplying 113619555625 by its sum of digits (49), we get a square (5567358225625 = 23595252).
The spelling of 113619555625 in words is "one hundred thirteen billion, six hundred nineteen million, five hundred fifty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •