Base | Representation |
---|---|
bin | 1011000110111010001101… |
… | …0101000001110010111101 |
3 | 1121020120202010021210110011 |
4 | 2301232203111001302331 |
5 | 3100100401022033432 |
6 | 41550421035543221 |
7 | 2400245520662566 |
oct | 261564325016275 |
9 | 47216663253404 |
10 | 12213332221117 |
11 | 3989710702065 |
12 | 14530382bab11 |
13 | 6a7934b804a1 |
14 | 3031b25c916d |
15 | 162a6ba6c847 |
hex | b1ba3541cbd |
12213332221117 has 2 divisors, whose sum is σ = 12213332221118. Its totient is φ = 12213332221116.
The previous prime is 12213332221109. The next prime is 12213332221291. The reversal of 12213332221117 is 71112223331221.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8156084844996 + 4057247376121 = 2855886^2 + 2014261^2 .
It is a cyclic number.
It is not a de Polignac number, because 12213332221117 - 23 = 12213332221109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12213339221117) 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, 6106666110558 + 6106666110559.
It is an arithmetic number, because the mean of its divisors is an integer number (6106666110559).
Almost surely, 212213332221117 is an apocalyptic number.
It is an amenable number.
12213332221117 is a deficient number, since it is larger than the sum of its proper divisors (1).
12213332221117 is an equidigital number, since it uses as much as digits as its factorization.
12213332221117 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 6048, while the sum is 31.
Adding to 12213332221117 its reverse (71112223331221), we get a palindrome (83325555552338).
The spelling of 12213332221117 in words is "twelve trillion, two hundred thirteen billion, three hundred thirty-two million, two hundred twenty-one thousand, one hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •