Base | Representation |
---|---|
bin | 111111110110010011010011… |
… | …1010000001110010110101001 |
3 | 2201122112001201002002222120222 |
4 | 1333230212213100032112221 |
5 | 1042103013131301443200 |
6 | 5310243144354055425 |
7 | 226203330264645515 |
oct | 17754464720162651 |
9 | 2648461632088528 |
10 | 561617024640425 |
11 | 152a484960a1726 |
12 | 52ba518527a575 |
13 | 1b14b3482a7c30 |
14 | 9c985a2535145 |
15 | 44dde334c7d85 |
hex | 1fec9a740e5a9 |
561617024640425 has 24 divisors (see below), whose sum is σ = 764125201153944. Its totient is φ = 406907429160960.
The previous prime is 561617024640337. The next prime is 561617024640473. The reversal of 561617024640425 is 524046420716165.
It can be written as a sum of positive squares in 12 ways, for example, as 225924858455209 + 335692166185216 = 15030797^2 + 18321904^2 .
It is not a de Polignac number, because 561617024640425 - 212 = 561617024636329 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a Duffinian number.
It is a Curzon number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 16302363752 + ... + 16302398201.
It is an arithmetic number, because the mean of its divisors is an integer number (31838550048081).
Almost surely, 2561617024640425 is an apocalyptic number.
It is an amenable number.
561617024640425 is a deficient number, since it is larger than the sum of its proper divisors (202508176513519).
561617024640425 is a wasteful number, since it uses less digits than its factorization.
561617024640425 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32604762029 (or 32604762024 counting only the distinct ones).
The product of its (nonzero) digits is 9676800, while the sum is 53.
The spelling of 561617024640425 in words is "five hundred sixty-one trillion, six hundred seventeen billion, twenty-four million, six hundred forty thousand, four hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.183 sec. • engine limits •