Base | Representation |
---|---|
bin | 1011011010001011010110… |
… | …0110011001100101011001 |
3 | 1122102020011101222120211221 |
4 | 2312202311212121211121 |
5 | 3121011312404343211 |
6 | 42402443450252041 |
7 | 2433204501165142 |
oct | 266426546314531 |
9 | 48366141876757 |
10 | 12544351246681 |
11 | 3aa7036280381 |
12 | 14a7219a27021 |
13 | 6ccc09213097 |
14 | 315215236ac9 |
15 | 16b492543c71 |
hex | b68b5999959 |
12544351246681 has 2 divisors, whose sum is σ = 12544351246682. Its totient is φ = 12544351246680.
The previous prime is 12544351246667. The next prime is 12544351246717. The reversal of 12544351246681 is 18664215344521.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10211220250000 + 2333130996681 = 3195500^2 + 1527459^2 .
It is a cyclic number.
It is not a de Polignac number, because 12544351246681 - 25 = 12544351246649 is a prime.
It is a super-2 number, since 2×125443512466812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12544351246621) 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 as a sum of consecutive naturals, namely, 6272175623340 + 6272175623341.
It is an arithmetic number, because the mean of its divisors is an integer number (6272175623341).
Almost surely, 212544351246681 is an apocalyptic number.
It is an amenable number.
12544351246681 is a deficient number, since it is larger than the sum of its proper divisors (1).
12544351246681 is an equidigital number, since it uses as much as digits as its factorization.
12544351246681 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5529600, while the sum is 52.
The spelling of 12544351246681 in words is "twelve trillion, five hundred forty-four billion, three hundred fifty-one million, two hundred forty-six thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •