Base | Representation |
---|---|
bin | 1100000001101000100100… |
… | …1001100011101100111101 |
3 | 1201211000211120102102201021 |
4 | 3000122021021203230331 |
5 | 3213113041320234323 |
6 | 44042111034544141 |
7 | 2533162461226435 |
oct | 300321111435475 |
9 | 51730746372637 |
10 | 13222210321213 |
11 | 4238565029a63 |
12 | 1596677598051 |
13 | 74bb0658869a |
14 | 339d5bb952c5 |
15 | 17de1793205d |
hex | c0689263b3d |
13222210321213 has 4 divisors (see below), whose sum is σ = 13309774628128. Its totient is φ = 13134646014300.
The previous prime is 13222210321181. The next prime is 13222210321219. The reversal of 13222210321213 is 31212301222231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13222210321213 - 25 = 13222210321181 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13222210321219) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 43782153231 + ... + 43782153532.
It is an arithmetic number, because the mean of its divisors is an integer number (3327443657032).
Almost surely, 213222210321213 is an apocalyptic number.
It is an amenable number.
13222210321213 is a deficient number, since it is larger than the sum of its proper divisors (87564306915).
13222210321213 is an equidigital number, since it uses as much as digits as its factorization.
13222210321213 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 87564306914.
The product of its (nonzero) digits is 1728, while the sum is 25.
Adding to 13222210321213 its reverse (31212301222231), we get a palindrome (44434511543444).
The spelling of 13222210321213 in words is "thirteen trillion, two hundred twenty-two billion, two hundred ten million, three hundred twenty-one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •