Base | Representation |
---|---|
bin | 1011001101110011000000… |
… | …0101001000111000011001 |
3 | 1121122220011102122222111121 |
4 | 2303130300011020320121 |
5 | 3104020213341312111 |
6 | 42121030234525241 |
7 | 2411634655322146 |
oct | 263346005107031 |
9 | 47586142588447 |
10 | 12331657760281 |
11 | 3a24910357a52 |
12 | 1471b5b296821 |
13 | 6b5b41190a12 |
14 | 308bd93b73cd |
15 | 165b94a16871 |
hex | b3730148e19 |
12331657760281 has 2 divisors, whose sum is σ = 12331657760282. Its totient is φ = 12331657760280.
The previous prime is 12331657760263. The next prime is 12331657760287. The reversal of 12331657760281 is 18206775613321.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8734152729600 + 3597505030681 = 2955360^2 + 1896709^2 .
It is a cyclic number.
It is not a de Polignac number, because 12331657760281 - 243 = 3535564738073 is a prime.
It is a super-2 number, since 2×123316577602812 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (12331657760287) 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, 6165828880140 + 6165828880141.
It is an arithmetic number, because the mean of its divisors is an integer number (6165828880141).
Almost surely, 212331657760281 is an apocalyptic number.
It is an amenable number.
12331657760281 is a deficient number, since it is larger than the sum of its proper divisors (1).
12331657760281 is an equidigital number, since it uses as much as digits as its factorization.
12331657760281 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2540160, while the sum is 52.
The spelling of 12331657760281 in words is "twelve trillion, three hundred thirty-one billion, six hundred fifty-seven million, seven hundred sixty thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •