Base | Representation |
---|---|
bin | 1100001110100000001101… |
… | …0011100101011010100001 |
3 | 1202121011111220111102001002 |
4 | 3003220003103211122201 |
5 | 3230223341043231423 |
6 | 44331433532321345 |
7 | 2555150403655463 |
oct | 303500323453241 |
9 | 52534456442032 |
10 | 13443303102113 |
11 | 4313300153695 |
12 | 161149b013255 |
13 | 76690c7a62b1 |
14 | 34693333c133 |
15 | 184a57a2e228 |
hex | c3a034e56a1 |
13443303102113 has 2 divisors, whose sum is σ = 13443303102114. Its totient is φ = 13443303102112.
The previous prime is 13443303102107. The next prime is 13443303102137. The reversal of 13443303102113 is 31120130334431.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13441257077824 + 2046024289 = 3666232^2 + 45233^2 .
It is a cyclic number.
It is not a de Polignac number, because 13443303102113 - 28 = 13443303101857 is a prime.
It is not a weakly prime, because it can be changed into another prime (13443303102413) 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, 6721651551056 + 6721651551057.
It is an arithmetic number, because the mean of its divisors is an integer number (6721651551057).
Almost surely, 213443303102113 is an apocalyptic number.
It is an amenable number.
13443303102113 is a deficient number, since it is larger than the sum of its proper divisors (1).
13443303102113 is an equidigital number, since it uses as much as digits as its factorization.
13443303102113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 29.
Adding to 13443303102113 its reverse (31120130334431), we get a palindrome (44563433436544).
The spelling of 13443303102113 in words is "thirteen trillion, four hundred forty-three billion, three hundred three million, one hundred two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •