Base | Representation |
---|---|
bin | 1011000110111001110000… |
… | …1111011010110100000101 |
3 | 1121020120102211112111100121 |
4 | 2301232130033122310011 |
5 | 3100100130101411323 |
6 | 41550401151141541 |
7 | 2400242545155556 |
oct | 261563417326405 |
9 | 47216384474317 |
10 | 12213213310213 |
11 | 398965a574593 |
12 | 14530045148b1 |
13 | 6a79163481c6 |
14 | 3031a08b432d |
15 | 162a613cea5d |
hex | b1b9c3dad05 |
12213213310213 has 2 divisors, whose sum is σ = 12213213310214. Its totient is φ = 12213213310212.
The previous prime is 12213213310139. The next prime is 12213213310219. The reversal of 12213213310213 is 31201331231221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7777143295009 + 4436070015204 = 2788753^2 + 2106198^2 .
It is a cyclic number.
It is not a de Polignac number, because 12213213310213 - 237 = 12075774356741 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12213213310219) 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, 6106606655106 + 6106606655107.
It is an arithmetic number, because the mean of its divisors is an integer number (6106606655107).
Almost surely, 212213213310213 is an apocalyptic number.
It is an amenable number.
12213213310213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12213213310213 is an equidigital number, since it uses as much as digits as its factorization.
12213213310213 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 12213213310213 its reverse (31201331231221), we get a palindrome (43414544541434).
The spelling of 12213213310213 in words is "twelve trillion, two hundred thirteen billion, two hundred thirteen million, three hundred ten thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •