Base | Representation |
---|---|
bin | 110001000101100110… |
… | …111010010000101001 |
3 | 12001001021100011000000 |
4 | 301011212322100221 |
5 | 1330421100414221 |
6 | 40114035133213 |
7 | 3544065544614 |
oct | 610546722051 |
9 | 161037304000 |
10 | 52707435561 |
11 | 20397a78500 |
12 | a26b744209 |
13 | 4c7c95a9c1 |
14 | 27a013b17b |
15 | 15873e7e26 |
hex | c459ba429 |
52707435561 has 63 divisors (see below), whose sum is σ = 86974708807. Its totient is φ = 31902575760.
The previous prime is 52707435541. The next prime is 52707435563. The reversal of 52707435561 is 16553470725.
It is a happy number.
The square root of 52707435561 is 229581.
It is a perfect power (a square), and thus also a powerful number.
52707435561 is a `hidden beast` number, since 5 + 27 + 0 + 74 + 3 + 556 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 3354147225 + 49353288336 = 57915^2 + 222156^2 .
It is not a de Polignac number, because 52707435561 - 221 = 52705338409 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (52707435563) by changing a digit.
It is a polite number, since it can be written in 62 ways as a sum of consecutive naturals, for example, 68185171 + ... + 68185943.
Almost surely, 252707435561 is an apocalyptic number.
52707435561 is the 229581-st square number.
52707435561 is the 114791-st centered octagonal number.
It is an amenable number.
52707435561 is a deficient number, since it is larger than the sum of its proper divisors (34267273246).
52707435561 is an frugal number, since it uses more digits than its factorization.
52707435561 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1586 (or 787 counting only the distinct ones).
The product of its (nonzero) digits is 882000, while the sum is 45.
The spelling of 52707435561 in words is "fifty-two billion, seven hundred seven million, four hundred thirty-five thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •