Base | Representation |
---|---|
bin | 1011101011100010011011… |
… | …1000111000100011100100 |
3 | 1200110202000012101212102011 |
4 | 2322320212320320203210 |
5 | 3140403123243122324 |
6 | 43151451112124004 |
7 | 2463563500321051 |
oct | 272704670704344 |
9 | 50422005355364 |
10 | 12842604660964 |
11 | 4101577585a01 |
12 | 1534b96396604 |
13 | 72208b234100 |
14 | 32582a408028 |
15 | 1740eb6eac94 |
hex | bae26e388e4 |
12842604660964 has 81 divisors (see below), whose sum is σ = 24468609962097. Its totient is φ = 5895318094848.
The previous prime is 12842604660931. The next prime is 12842604660971. The reversal of 12842604660964 is 46906640624821.
The square root of 12842604660964 is 3583658.
It is a perfect power (a square), and thus also a powerful number.
12842604660964 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 13 ways, for example, as 8225091315364 + 4617513345600 = 2867942^2 + 2148840^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12842604660899 and 12842604660908.
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, 31400011192 + ... + 31400011600.
Almost surely, 212842604660964 is an apocalyptic number.
12842604660964 is the 3583658-th square number.
It is an amenable number.
12842604660964 is a deficient number, since it is larger than the sum of its proper divisors (11626005301133).
12842604660964 is an frugal number, since it uses more digits than its factorization.
12842604660964 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1522 (or 761 counting only the distinct ones).
The product of its (nonzero) digits is 23887872, while the sum is 58.
The spelling of 12842604660964 in words is "twelve trillion, eight hundred forty-two billion, six hundred four million, six hundred sixty thousand, nine hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •