Base | Representation |
---|---|
bin | 11000101010100110… |
… | …00001111100101101 |
3 | 1021011212120002001112 |
4 | 30111103001330231 |
5 | 204110001242031 |
6 | 10030002321405 |
7 | 646103642324 |
oct | 142523017455 |
9 | 37155502045 |
10 | 13242212141 |
11 | 5685979a84 |
12 | 2696959265 |
13 | 13306186b2 |
14 | 8d89b90bb |
15 | 52784862b |
hex | 3154c1f2d |
13242212141 has 2 divisors, whose sum is σ = 13242212142. Its totient is φ = 13242212140.
The previous prime is 13242212047. The next prime is 13242212161. The reversal of 13242212141 is 14121224231.
13242212141 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11625368041 + 1616844100 = 107821^2 + 40210^2 .
It is a cyclic number.
It is not a de Polignac number, because 13242212141 - 218 = 13241949997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13242212161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6621106070 + 6621106071.
It is an arithmetic number, because the mean of its divisors is an integer number (6621106071).
Almost surely, 213242212141 is an apocalyptic number.
It is an amenable number.
13242212141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13242212141 is an equidigital number, since it uses as much as digits as its factorization.
13242212141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 768, while the sum is 23.
Adding to 13242212141 its reverse (14121224231), we get a palindrome (27363436372).
The spelling of 13242212141 in words is "thirteen billion, two hundred forty-two million, two hundred twelve thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •