Base | Representation |
---|---|
bin | 1010000000101010110100… |
… | …01111001011100111111101 |
3 | 2212221102222020120001201021 |
4 | 11000111122033023213331 |
5 | 10341131034124234323 |
6 | 114452422333544141 |
7 | 4431255100632643 |
oct | 500253217134775 |
9 | 85842866501637 |
10 | 22013221321213 |
11 | 7017833609171 |
12 | 2576387345051 |
13 | c38ab7a2a9a5 |
14 | 561634a09193 |
15 | 28293393205d |
hex | 14055a3cb9fd |
22013221321213 has 2 divisors, whose sum is σ = 22013221321214. Its totient is φ = 22013221321212.
The previous prime is 22013221321211. The next prime is 22013221321241. The reversal of 22013221321213 is 31212312231022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13417078162489 + 8596143158724 = 3662933^2 + 2931918^2 .
It is a cyclic number.
It is not a de Polignac number, because 22013221321213 - 21 = 22013221321211 is a prime.
Together with 22013221321211, 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 (22013221321211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11006610660606 + 11006610660607.
It is an arithmetic number, because the mean of its divisors is an integer number (11006610660607).
Almost surely, 222013221321213 is an apocalyptic number.
It is an amenable number.
22013221321213 is a deficient number, since it is larger than the sum of its proper divisors (1).
22013221321213 is an equidigital number, since it uses as much as digits as its factorization.
22013221321213 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 22013221321213 its reverse (31212312231022), we get a palindrome (53225533552235).
The spelling of 22013221321213 in words is "twenty-two trillion, thirteen billion, two hundred twenty-one million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •