Base | Representation |
---|---|
bin | 1011111101000011000001… |
… | …1111010110011001010111 |
3 | 1201112111110002012122120212 |
4 | 2333100300133112121113 |
5 | 3210320202320402302 |
6 | 43542000100320035 |
7 | 2524403015665046 |
oct | 277206037263127 |
9 | 51474402178525 |
10 | 13143413450327 |
11 | 42080aa276666 |
12 | 15833466a301b |
13 | 7445597a23b4 |
14 | 336204b2255d |
15 | 17bd54dbb052 |
hex | bf4307d6657 |
13143413450327 has 2 divisors, whose sum is σ = 13143413450328. Its totient is φ = 13143413450326.
The previous prime is 13143413450309. The next prime is 13143413450329. The reversal of 13143413450327 is 72305431434131.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 13143413450327 - 28 = 13143413450071 is a prime.
Together with 13143413450329, 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 (13143413450329) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6571706725163 + 6571706725164.
It is an arithmetic number, because the mean of its divisors is an integer number (6571706725164).
Almost surely, 213143413450327 is an apocalyptic number.
13143413450327 is a deficient number, since it is larger than the sum of its proper divisors (1).
13143413450327 is an equidigital number, since it uses as much as digits as its factorization.
13143413450327 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 362880, while the sum is 41.
Adding to 13143413450327 its reverse (72305431434131), we get a palindrome (85448844884458).
The spelling of 13143413450327 in words is "thirteen trillion, one hundred forty-three billion, four hundred thirteen million, four hundred fifty thousand, three hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •