Base | Representation |
---|---|
bin | 1011000110111010001000… |
… | …1001000111101010100101 |
3 | 1121020120200201211211021201 |
4 | 2301232202021013222211 |
5 | 3100100330423302323 |
6 | 41550415045242501 |
7 | 2400245156564362 |
oct | 261564211075245 |
9 | 47216621754251 |
10 | 12213312322213 |
11 | 3989700450792 |
12 | 1453031703431 |
13 | 6a7930a040a2 |
14 | 3031adac9469 |
15 | 162a69e3b8ad |
hex | b1ba2247aa5 |
12213312322213 has 2 divisors, whose sum is σ = 12213312322214. Its totient is φ = 12213312322212.
The previous prime is 12213312322193. The next prime is 12213312322219. The reversal of 12213312322213 is 31222321331221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8337898801764 + 3875413520449 = 2887542^2 + 1968607^2 .
It is an emirp because it is prime and its reverse (31222321331221) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12213312322213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12213312322219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6106656161106 + 6106656161107.
It is an arithmetic number, because the mean of its divisors is an integer number (6106656161107).
Almost surely, 212213312322213 is an apocalyptic number.
It is an amenable number.
12213312322213 is a deficient number, since it is larger than the sum of its proper divisors (1).
12213312322213 is an equidigital number, since it uses as much as digits as its factorization.
12213312322213 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 5184, while the sum is 28.
Adding to 12213312322213 its reverse (31222321331221), we get a palindrome (43435633653434).
The spelling of 12213312322213 in words is "twelve trillion, two hundred thirteen billion, three hundred twelve million, three hundred twenty-two thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •