Base | Representation |
---|---|
bin | 1100000000010110111111… |
… | …0111111000110010111101 |
3 | 1201201221022101210002122021 |
4 | 3000011233313320302331 |
5 | 3212233214211002031 |
6 | 44024050033320141 |
7 | 2531456010526564 |
oct | 300055767706275 |
9 | 51657271702567 |
10 | 13200311422141 |
11 | 422a247736a68 |
12 | 1592385706051 |
13 | 749a2667433c |
14 | 338c81610bdb |
15 | 17d585124511 |
hex | c016fdf8cbd |
13200311422141 has 2 divisors, whose sum is σ = 13200311422142. Its totient is φ = 13200311422140.
The previous prime is 13200311422061. The next prime is 13200311422153. The reversal of 13200311422141 is 14122411300231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10096055050041 + 3104256372100 = 3177429^2 + 1761890^2 .
It is a cyclic number.
It is not a de Polignac number, because 13200311422141 - 215 = 13200311389373 is a prime.
It is a super-2 number, since 2×132003114221412 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13200311422541) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600155711070 + 6600155711071.
It is an arithmetic number, because the mean of its divisors is an integer number (6600155711071).
Almost surely, 213200311422141 is an apocalyptic number.
It is an amenable number.
13200311422141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13200311422141 is an equidigital number, since it uses as much as digits as its factorization.
13200311422141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 13200311422141 its reverse (14122411300231), we get a palindrome (27322722722372).
The spelling of 13200311422141 in words is "thirteen trillion, two hundred billion, three hundred eleven million, four hundred twenty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •