Base | Representation |
---|---|
bin | 1011010101000100110010… |
… | …0001000010110010110011 |
3 | 1122002211220001210102011011 |
4 | 2311101030201002302303 |
5 | 3113042244323422021 |
6 | 42254305053531351 |
7 | 2423652235351303 |
oct | 265211441026263 |
9 | 48084801712134 |
10 | 12456688889011 |
11 | 3a729411505a4 |
12 | 1492233aa3b57 |
13 | 6c48787b5623 |
14 | 310c9a9a5603 |
15 | 169061521de1 |
hex | b544c842cb3 |
12456688889011 has 8 divisors (see below), whose sum is σ = 12461556159360. Its totient is φ = 12451822128768.
The previous prime is 12456688888999. The next prime is 12456688889033. The reversal of 12456688889011 is 11098888665421.
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 12456688889011 - 217 = 12456688757939 is a prime.
It is a super-2 number, since 2×124566888890112 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12456688889611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52996830 + ... + 53231356.
It is an arithmetic number, because the mean of its divisors is an integer number (1557694519920).
Almost surely, 212456688889011 is an apocalyptic number.
12456688889011 is a deficient number, since it is larger than the sum of its proper divisors (4867270349).
12456688889011 is a wasteful number, since it uses less digits than its factorization.
12456688889011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 255053.
The product of its (nonzero) digits is 53084160, while the sum is 67.
The spelling of 12456688889011 in words is "twelve trillion, four hundred fifty-six billion, six hundred eighty-eight million, eight hundred eighty-nine thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •