Base | Representation |
---|---|
bin | 10000010101001001111… |
… | …01100101010101101001 |
3 | 1222122022221202211210021 |
4 | 20022210331211111221 |
5 | 33143130004340000 |
6 | 1105434422320441 |
7 | 55352624553664 |
oct | 10124475452551 |
9 | 1878287684707 |
10 | 561113355625 |
11 | 1a6a6a952079 |
12 | 908b7889121 |
13 | 40bb3453974 |
14 | 1d22d8d06db |
15 | e8e0ea911a |
hex | 82a4f65569 |
561113355625 has 75 divisors (see below), whose sum is σ = 749145238193. Its totient is φ = 420141186000.
The previous prime is 561113355623. The next prime is 561113355653. The reversal of 561113355625 is 526553311165.
The square root of 561113355625 is 749075.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 2 ways, for example, as 43991287081 + 517122068544 = 209741^2 + 719112^2 .
It is not a de Polignac number, because 561113355625 - 21 = 561113355623 is a prime.
It is not an unprimeable number, because it can be changed into a prime (561113355623) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 74 ways as a sum of consecutive naturals, for example, 6760401834 + ... + 6760401916.
Almost surely, 2561113355625 is an apocalyptic number.
561113355625 is the 749075-th square number.
561113355625 is the 374538-th centered octagonal number.
It is an amenable number.
561113355625 is a deficient number, since it is larger than the sum of its proper divisors (188031882568).
561113355625 is an frugal number, since it uses more digits than its factorization.
561113355625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 262 (or 107 counting only the distinct ones).
The product of its digits is 405000, while the sum is 43.
The spelling of 561113355625 in words is "five hundred sixty-one billion, one hundred thirteen million, three hundred fifty-five thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •