Base | Representation |
---|---|
bin | 1010111011101110110111… |
… | …1111010110111010101101 |
3 | 1120120020002212001111001121 |
4 | 2232323231333112322231 |
5 | 3033424121143201331 |
6 | 41322303021140541 |
7 | 2350340205055144 |
oct | 256735577267255 |
9 | 46506085044047 |
10 | 12021311303341 |
11 | 391523392149a |
12 | 14219889ba751 |
13 | 6927b295c352 |
14 | 2d7b980c875b |
15 | 15ca7dd60c11 |
hex | aeeedfd6ead |
12021311303341 has 2 divisors, whose sum is σ = 12021311303342. Its totient is φ = 12021311303340.
The previous prime is 12021311303303. The next prime is 12021311303401. The reversal of 12021311303341 is 14330311312021.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6743609147716 + 5277702155625 = 2596846^2 + 2297325^2 .
It is a cyclic number.
It is not a de Polignac number, because 12021311303341 - 243 = 3225218281133 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12021311303741) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6010655651670 + 6010655651671.
It is an arithmetic number, because the mean of its divisors is an integer number (6010655651671).
Almost surely, 212021311303341 is an apocalyptic number.
It is an amenable number.
12021311303341 is a deficient number, since it is larger than the sum of its proper divisors (1).
12021311303341 is an equidigital number, since it uses as much as digits as its factorization.
12021311303341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 12021311303341 its reverse (14330311312021), we get a palindrome (26351622615362).
The spelling of 12021311303341 in words is "twelve trillion, twenty-one billion, three hundred eleven million, three hundred three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •