Base | Representation |
---|---|
bin | 1011011001101111011000… |
… | …0011000001110111001001 |
3 | 1122101111210010001201122021 |
4 | 2312123312003001313021 |
5 | 3120400423143341141 |
6 | 42355202421124441 |
7 | 2432520434326162 |
oct | 266336603016711 |
9 | 48344703051567 |
10 | 12536842558921 |
11 | 3aa39328760aa |
12 | 14a5883259721 |
13 | 6cc2b0702885 |
14 | 314b01d02769 |
15 | 16b1a32476d1 |
hex | b66f60c1dc9 |
12536842558921 has 2 divisors, whose sum is σ = 12536842558922. Its totient is φ = 12536842558920.
The previous prime is 12536842558873. The next prime is 12536842558937. The reversal of 12536842558921 is 12985524863521.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11605162023225 + 931680535696 = 3406635^2 + 965236^2 .
It is a cyclic number.
It is not a de Polignac number, because 12536842558921 - 223 = 12536834170313 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 12536842558921.
It is not a weakly prime, because it can be changed into another prime (12536842558951) 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, 6268421279460 + 6268421279461.
It is an arithmetic number, because the mean of its divisors is an integer number (6268421279461).
Almost surely, 212536842558921 is an apocalyptic number.
It is an amenable number.
12536842558921 is a deficient number, since it is larger than the sum of its proper divisors (1).
12536842558921 is an equidigital number, since it uses as much as digits as its factorization.
12536842558921 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 41472000, while the sum is 61.
The spelling of 12536842558921 in words is "twelve trillion, five hundred thirty-six billion, eight hundred forty-two million, five hundred fifty-eight thousand, nine hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •