Base | Representation |
---|---|
bin | 1100001101010110100101… |
… | …1101101111011100111101 |
3 | 1202112021111201212210012222 |
4 | 3003111221131233130331 |
5 | 3224412403301013341 |
6 | 44314405023535125 |
7 | 2553550614054332 |
oct | 303255135573475 |
9 | 52467451783188 |
10 | 13423542204221 |
11 | 430598a694616 |
12 | 16096a515a4a5 |
13 | 764ab07c68c6 |
14 | 3459baad6989 |
15 | 18429cc9344b |
hex | c356976f73d |
13423542204221 has 2 divisors, whose sum is σ = 13423542204222. Its totient is φ = 13423542204220.
The previous prime is 13423542204179. The next prime is 13423542204223. The reversal of 13423542204221 is 12240224532431.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10507938144025 + 2915604060196 = 3241595^2 + 1707514^2 .
It is a cyclic number.
It is not a de Polignac number, because 13423542204221 - 242 = 9025495693117 is a prime.
Together with 13423542204223, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13423542204223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6711771102110 + 6711771102111.
It is an arithmetic number, because the mean of its divisors is an integer number (6711771102111).
Almost surely, 213423542204221 is an apocalyptic number.
It is an amenable number.
13423542204221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13423542204221 is an equidigital number, since it uses as much as digits as its factorization.
13423542204221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 92160, while the sum is 35.
Adding to 13423542204221 its reverse (12240224532431), we get a palindrome (25663766736652).
The spelling of 13423542204221 in words is "thirteen trillion, four hundred twenty-three billion, five hundred forty-two million, two hundred four thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •