Base | Representation |
---|---|
bin | 1100000000010110101010… |
… | …0000001011001111001101 |
3 | 1201201221002010020102221011 |
4 | 3000011222200023033031 |
5 | 3212233023124221031 |
6 | 44024033054205221 |
7 | 2531453534630542 |
oct | 300055240131715 |
9 | 51657063212834 |
10 | 13200221320141 |
11 | 422a200895aa9 |
12 | 159235b4b3811 |
13 | 749a10ab7b4b |
14 | 338c73678bc9 |
15 | 17d57c2776b1 |
hex | c016a80b3cd |
13200221320141 has 2 divisors, whose sum is σ = 13200221320142. Its totient is φ = 13200221320140.
The previous prime is 13200221320079. The next prime is 13200221320193. The reversal of 13200221320141 is 14102312200231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13187218479241 + 13002840900 = 3631421^2 + 114030^2 .
It is an emirp because it is prime and its reverse (14102312200231) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 13200221320141 - 221 = 13200219222989 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13200221327141) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600110660070 + 6600110660071.
It is an arithmetic number, because the mean of its divisors is an integer number (6600110660071).
Almost surely, 213200221320141 is an apocalyptic number.
It is an amenable number.
13200221320141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200221320141 is an equidigital number, since it uses as much as digits as its factorization.
13200221320141 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 576, while the sum is 22.
Adding to 13200221320141 its reverse (14102312200231), we get a palindrome (27302533520372).
The spelling of 13200221320141 in words is "thirteen trillion, two hundred billion, two hundred twenty-one million, three hundred twenty thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •