Base | Representation |
---|---|
bin | 111110101001010011001… |
… | …0010110100100000000000 |
3 | 1010111002200001010202022111 |
4 | 1331102212102310200000 |
5 | 2112031041012201142 |
6 | 30151200244145104 |
7 | 1546021312663033 |
oct | 175224622644000 |
9 | 33432601122274 |
10 | 8609904412672 |
11 | 281a492643652 |
12 | b707a7698194 |
13 | 4a5bab4b1984 |
14 | 21aa160c301a |
15 | ede6b5ade17 |
hex | 7d4a64b4800 |
8609904412672 has 96 divisors (see below), whose sum is σ = 17481855245400. Its totient is φ = 4238579073024.
The previous prime is 8609904412663. The next prime is 8609904412693. The reversal of 8609904412672 is 2762144099068.
It can be written as a sum of positive squares in 4 ways, for example, as 8300483675136 + 309420737536 = 2881056^2 + 556256^2 .
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 86213904 + ... + 86313712.
Almost surely, 28609904412672 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 8609904412672, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (8740927622700).
8609904412672 is an abundant number, since it is smaller than the sum of its proper divisors (8871950832728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
8609904412672 is an equidigital number, since it uses as much as digits as its factorization.
8609904412672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100481 (or 100461 counting only the distinct ones).
The product of its (nonzero) digits is 10450944, while the sum is 58.
The spelling of 8609904412672 in words is "eight trillion, six hundred nine billion, nine hundred four million, four hundred twelve thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •