Base | Representation |
---|---|
bin | 1011110010001100001101… |
… | …1000000100011001011001 |
3 | 1200212200000120210121210121 |
4 | 2330203003120010121121 |
5 | 3144241212200400241 |
6 | 43320152313313241 |
7 | 2505051020201563 |
oct | 274430330043131 |
9 | 50780016717717 |
10 | 12956899231321 |
11 | 4145a98915311 |
12 | 1553173405821 |
13 | 72caa439bcb6 |
14 | 32b18db00333 |
15 | 17708a853ad1 |
hex | bc8c3604659 |
12956899231321 has 2 divisors, whose sum is σ = 12956899231322. Its totient is φ = 12956899231320.
The previous prime is 12956899231249. The next prime is 12956899231349. The reversal of 12956899231321 is 12313299865921.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7707924979225 + 5248974252096 = 2776315^2 + 2291064^2 .
It is a cyclic number.
It is not a de Polignac number, because 12956899231321 - 27 = 12956899231193 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12956899231321.
It is not a weakly prime, because it can be changed into another prime (12956899231121) 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 as a sum of consecutive naturals, namely, 6478449615660 + 6478449615661.
It is an arithmetic number, because the mean of its divisors is an integer number (6478449615661).
Almost surely, 212956899231321 is an apocalyptic number.
It is an amenable number.
12956899231321 is a deficient number, since it is larger than the sum of its proper divisors (1).
12956899231321 is an equidigital number, since it uses as much as digits as its factorization.
12956899231321 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12597120, while the sum is 61.
The spelling of 12956899231321 in words is "twelve trillion, nine hundred fifty-six billion, eight hundred ninety-nine million, two hundred thirty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •