Base | Representation |
---|---|
bin | 1100010001111110110000… |
… | …0011011101011101101101 |
3 | 1202210212201020210100201022 |
4 | 3010133230003131131231 |
5 | 3232213212342311141 |
6 | 44415113452023525 |
7 | 2562363660555146 |
oct | 304375403353555 |
9 | 52725636710638 |
10 | 13503042541421 |
11 | 4336676544634 |
12 | 1620b91761ba5 |
13 | 76c440263c54 |
14 | 34979d366acd |
15 | 1863a2463b4b |
hex | c47ec0dd76d |
13503042541421 has 2 divisors, whose sum is σ = 13503042541422. Its totient is φ = 13503042541420.
The previous prime is 13503042541367. The next prime is 13503042541423. The reversal of 13503042541421 is 12414524030531.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11311416930025 + 2191625611396 = 3363245^2 + 1480414^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13503042541421 is a prime.
Together with 13503042541423, 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 (13503042541423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6751521270710 + 6751521270711.
It is an arithmetic number, because the mean of its divisors is an integer number (6751521270711).
Almost surely, 213503042541421 is an apocalyptic number.
It is an amenable number.
13503042541421 is a deficient number, since it is larger than the sum of its proper divisors (1).
13503042541421 is an equidigital number, since it uses as much as digits as its factorization.
13503042541421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 57600, while the sum is 35.
Adding to 13503042541421 its reverse (12414524030531), we get a palindrome (25917566571952).
The spelling of 13503042541421 in words is "thirteen trillion, five hundred three billion, forty-two million, five hundred forty-one thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •