Base | Representation |
---|---|
bin | 1011011010111010100010… |
… | …0001110000101111110001 |
3 | 1122110102212002111211101011 |
4 | 2312232220201300233301 |
5 | 3121213232302011123 |
6 | 42412340333510521 |
7 | 2434133403644644 |
oct | 266565041605761 |
9 | 48412762454334 |
10 | 12557016828913 |
11 | 4001445703807 |
12 | 14a9773642441 |
13 | 70117722623b |
14 | 315a973cda5b |
15 | 16b984438e0d |
hex | b6ba8870bf1 |
12557016828913 has 8 divisors (see below), whose sum is σ = 13103581248000. Its totient is φ = 12010503007008.
The previous prime is 12557016828911. The next prime is 12557016829069. The reversal of 12557016828913 is 31982861075521.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12557016828913 - 21 = 12557016828911 is a prime.
It is a super-3 number, since 3×125570168289133 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12557016828911) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 12141708 + ... + 13135261.
It is an arithmetic number, because the mean of its divisors is an integer number (1637947656000).
Almost surely, 212557016828913 is an apocalyptic number.
It is an amenable number.
12557016828913 is a deficient number, since it is larger than the sum of its proper divisors (546564419087).
12557016828913 is a wasteful number, since it uses less digits than its factorization.
12557016828913 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25298591.
The product of its (nonzero) digits is 7257600, while the sum is 58.
The spelling of 12557016828913 in words is "twelve trillion, five hundred fifty-seven billion, sixteen million, eight hundred twenty-eight thousand, nine hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •