Base | Representation |
---|---|
bin | 1011100001000010100110… |
… | …0011101110101101101011 |
3 | 1122211111111201122120012012 |
4 | 2320100221203232231223 |
5 | 3124424302232231333 |
6 | 42532543505510135 |
7 | 2444550425060444 |
oct | 270205143565553 |
9 | 48744451576165 |
10 | 12662260820843 |
11 | 4042042146637 |
12 | 150604564234b |
13 | 70b07a2b238a |
14 | 31abdcaa62cb |
15 | 16e593c23e48 |
hex | b84298eeb6b |
12662260820843 has 4 divisors (see below), whose sum is σ = 12761963662080. Its totient is φ = 12562557979608.
The previous prime is 12662260820819. The next prime is 12662260820863. The reversal of 12662260820843 is 34802806226621.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12662260820843 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12662260820791 and 12662260820800.
It is not an unprimeable number, because it can be changed into a prime (12662260820863) 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 3 ways as a sum of consecutive naturals, for example, 49851420428 + ... + 49851420681.
It is an arithmetic number, because the mean of its divisors is an integer number (3190490915520).
Almost surely, 212662260820843 is an apocalyptic number.
12662260820843 is a deficient number, since it is larger than the sum of its proper divisors (99702841237).
12662260820843 is an equidigital number, since it uses as much as digits as its factorization.
12662260820843 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99702841236.
The product of its (nonzero) digits is 2654208, while the sum is 50.
The spelling of 12662260820843 in words is "twelve trillion, six hundred sixty-two billion, two hundred sixty million, eight hundred twenty thousand, eight hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •