Base | Representation |
---|---|
bin | 1011000110110101101100… |
… | …0101001100100011001111 |
3 | 1121020110121122111020101101 |
4 | 2301231123011030203033 |
5 | 3100040410222030221 |
6 | 41550100500123531 |
7 | 2400203502140011 |
oct | 261553305144317 |
9 | 47213548436341 |
10 | 12212120111311 |
11 | 398914948501a |
12 | 145295a3965a7 |
13 | 6a77a0a09053 |
14 | 3030d96261b1 |
15 | 1629ea43dd91 |
hex | b1b5b14c8cf |
12212120111311 has 2 divisors, whose sum is σ = 12212120111312. Its totient is φ = 12212120111310.
The previous prime is 12212120111309. The next prime is 12212120111381. The reversal of 12212120111311 is 11311102121221.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 12212120111311 - 21 = 12212120111309 is a prime.
It is a super-2 number, since 2×122121201113112 (a number of 27 digits) contains 22 as substring.
Together with 12212120111309, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12212120111381) 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, 6106060055655 + 6106060055656.
It is an arithmetic number, because the mean of its divisors is an integer number (6106060055656).
Almost surely, 212212120111311 is an apocalyptic number.
12212120111311 is a deficient number, since it is larger than the sum of its proper divisors (1).
12212120111311 is an equidigital number, since it uses as much as digits as its factorization.
12212120111311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 19.
Adding to 12212120111311 its reverse (11311102121221), we get a palindrome (23523222232532).
The spelling of 12212120111311 in words is "twelve trillion, two hundred twelve billion, one hundred twenty million, one hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •