Base | Representation |
---|---|
bin | 11000011110110101… |
… | …01011010001110101 |
3 | 1020220222220200100111 |
4 | 30033122223101311 |
5 | 203404222200031 |
6 | 10012115543021 |
7 | 643465233625 |
oct | 141732532165 |
9 | 36828820314 |
10 | 13143553141 |
11 | 5635214014 |
12 | 26698baa71 |
13 | 13160543a4 |
14 | 8c9856885 |
15 | 51dd5b1b1 |
hex | 30f6ab475 |
13143553141 has 2 divisors, whose sum is σ = 13143553142. Its totient is φ = 13143553140.
The previous prime is 13143553127. The next prime is 13143553153. The reversal of 13143553141 is 14135534131.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 6963234916 + 6180318225 = 83446^2 + 78615^2 .
It is a cyclic number.
It is not a de Polignac number, because 13143553141 - 29 = 13143552629 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13143553541) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6571776570 + 6571776571.
It is an arithmetic number, because the mean of its divisors is an integer number (6571776571).
Almost surely, 213143553141 is an apocalyptic number.
It is an amenable number.
13143553141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13143553141 is an equidigital number, since it uses as much as digits as its factorization.
13143553141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10800, while the sum is 31.
The spelling of 13143553141 in words is "thirteen billion, one hundred forty-three million, five hundred fifty-three thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •