Base | Representation |
---|---|
bin | 1011011111111001001010… |
… | …0010110101011100000001 |
3 | 1122202121121212021212021001 |
4 | 2313332102202311130001 |
5 | 3124113414110414231 |
6 | 42515523413532001 |
7 | 2443252052310301 |
oct | 267762242653401 |
9 | 48677555255231 |
10 | 12642547357441 |
11 | 4034746435821 |
12 | 1502263644001 |
13 | 7092580a0431 |
14 | 319c8c88b601 |
15 | 16dcdd207b61 |
hex | b7f928b5701 |
12642547357441 has 4 divisors (see below), whose sum is σ = 13307944586800. Its totient is φ = 11977150128084.
The previous prime is 12642547357421. The next prime is 12642547357483. The reversal of 12642547357441 is 14475374524621.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 12642547357441 - 25 = 12642547357409 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12642547357421) 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, 332698614651 + ... + 332698614688.
It is an arithmetic number, because the mean of its divisors is an integer number (3326986146700).
Almost surely, 212642547357441 is an apocalyptic number.
It is an amenable number.
12642547357441 is a deficient number, since it is larger than the sum of its proper divisors (665397229359).
12642547357441 is an equidigital number, since it uses as much as digits as its factorization.
12642547357441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 665397229358.
The product of its digits is 22579200, while the sum is 55.
The spelling of 12642547357441 in words is "twelve trillion, six hundred forty-two billion, five hundred forty-seven million, three hundred fifty-seven thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •