Base | Representation |
---|---|
bin | 1100000001000100000100… |
… | …1000011110011011101101 |
3 | 1201210002112201102102111112 |
4 | 3000101001020132123231 |
5 | 3212433010002041331 |
6 | 44033410502001405 |
7 | 2532364614131255 |
oct | 300210110363355 |
9 | 51702481372445 |
10 | 13212412143341 |
11 | 42343972319a4 |
12 | 15947a2116265 |
13 | 74ac046429b8 |
14 | 3396ac76a965 |
15 | 17da4263d32b |
hex | c044121e6ed |
13212412143341 has 2 divisors, whose sum is σ = 13212412143342. Its totient is φ = 13212412143340.
The previous prime is 13212412143319. The next prime is 13212412143349. The reversal of 13212412143341 is 14334121421231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11656392909316 + 1556019234025 = 3414146^2 + 1247405^2 .
It is a cyclic number.
It is not a de Polignac number, because 13212412143341 - 26 = 13212412143277 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13212412143298 and 13212412143307.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13212412143349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6606206071670 + 6606206071671.
It is an arithmetic number, because the mean of its divisors is an integer number (6606206071671).
Almost surely, 213212412143341 is an apocalyptic number.
It is an amenable number.
13212412143341 is a deficient number, since it is larger than the sum of its proper divisors (1).
13212412143341 is an equidigital number, since it uses as much as digits as its factorization.
13212412143341 is an evil number, because the sum of its binary digits is even.
The product of its digits is 13824, while the sum is 32.
Adding to 13212412143341 its reverse (14334121421231), we get a palindrome (27546533564572).
The spelling of 13212412143341 in words is "thirteen trillion, two hundred twelve billion, four hundred twelve million, one hundred forty-three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •