Base | Representation |
---|---|
bin | 11100010011110011011… |
… | …10100000001101000100 |
3 | 10102222201110202202120011 |
4 | 32021321232200031010 |
5 | 111414044414430224 |
6 | 2022504320320004 |
7 | 130163350512400 |
oct | 16117156401504 |
9 | 3388643682504 |
10 | 972704842564 |
11 | 345581586144 |
12 | 138624a73004 |
13 | 709583c4400 |
14 | 35117332100 |
15 | 1a48032c394 |
hex | e279ba0344 |
972704842564 has 81 divisors (see below), whose sum is σ = 2144580919677. Its totient is φ = 384735300768.
The previous prime is 972704842559. The next prime is 972704842573. The reversal of 972704842564 is 465248407279.
The square root of 972704842564 is 986258.
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., 143891248900 + 828813593664 = 379330^2 + 910392^2 .
It is a junction number, because it is equal to n+sod(n) for n = 972704842499 and 972704842508.
It is an unprimeable number.
It is a polite number, since it can be written in 26 ways as a sum of consecutive naturals, for example, 179496247 + ... + 179501665.
Almost surely, 2972704842564 is an apocalyptic number.
972704842564 is the 986258-th square number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 972704842564
972704842564 is an abundant number, since it is smaller than the sum of its proper divisors (1171876077113).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
972704842564 is an equidigital number, since it uses as much as digits as its factorization.
972704842564 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10882 (or 5441 counting only the distinct ones).
The product of its (nonzero) digits is 27095040, while the sum is 58.
The spelling of 972704842564 in words is "nine hundred seventy-two billion, seven hundred four million, eight hundred forty-two thousand, five hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •