Base | Representation |
---|---|
bin | 100111011000110000… |
… | …1010010000011100001 |
3 | 22002022201012212012021 |
4 | 1032301201102003201 |
5 | 2341211130424221 |
6 | 102505020101441 |
7 | 6053015560114 |
oct | 1166141220341 |
9 | 262281185167 |
10 | 84582670561 |
11 | 32964792324 |
12 | 14486694881 |
13 | 7c8c6953bc |
14 | 414564457b |
15 | 230098c041 |
hex | 13b18520e1 |
84582670561 has 9 divisors (see below), whose sum is σ = 84932818131. Its totient is φ = 84233964192.
The previous prime is 84582670559. The next prime is 84582670589. The reversal of 84582670561 is 16507628548.
It is a happy number.
The square root of 84582670561 is 290831.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 22808550625 + 61774119936 = 151025^2 + 248544^2 .
It is not a de Polignac number, because 84582670561 - 21 = 84582670559 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 84582670499 and 84582670508.
It is not an unprimeable number, because it can be changed into a prime (84582670541) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 98009616 + ... + 98010478.
Almost surely, 284582670561 is an apocalyptic number.
84582670561 is the 290831-st square number.
84582670561 is the 145416-th centered octagonal number.
It is an amenable number.
84582670561 is a deficient number, since it is larger than the sum of its proper divisors (350147570).
84582670561 is an frugal number, since it uses more digits than its factorization.
84582670561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2400 (or 1200 counting only the distinct ones).
The product of its (nonzero) digits is 3225600, while the sum is 52.
The spelling of 84582670561 in words is "eighty-four billion, five hundred eighty-two million, six hundred seventy thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •