Base | Representation |
---|---|
bin | 1011110001111100011100… |
… | …0000000110000101000000 |
3 | 1200212021002111111212112110 |
4 | 2330133013000012011000 |
5 | 3144204024230311240 |
6 | 43314212221055320 |
7 | 2504541054445416 |
oct | 274370700060500 |
9 | 50767074455473 |
10 | 12952665088320 |
11 | 4144215848a81 |
12 | 15523913b7540 |
13 | 72c57b0ca639 |
14 | 32acab63b2b6 |
15 | 176dddc7cc80 |
hex | bc7c7006140 |
12952665088320 has 56 divisors (see below), whose sum is σ = 41124711658464. Its totient is φ = 3454044023296.
The previous prime is 12952665088301. The next prime is 12952665088327. The reversal of 12952665088320 is 2388056625921.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12952665088327) by changing a digit.
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, 6746178774 + ... + 6746180693.
It is an arithmetic number, because the mean of its divisors is an integer number (734369851044).
Almost surely, 212952665088320 is an apocalyptic number.
12952665088320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12952665088320 is an abundant number, since it is smaller than the sum of its proper divisors (28172046570144).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12952665088320 is a wasteful number, since it uses less digits than its factorization.
12952665088320 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13492359487 (or 13492359477 counting only the distinct ones).
The product of its (nonzero) digits is 12441600, while the sum is 57.
The spelling of 12952665088320 in words is "twelve trillion, nine hundred fifty-two billion, six hundred sixty-five million, eighty-eight thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •