Base | Representation |
---|---|
bin | 1100000111111011000001… |
… | …0101110000011111010101 |
3 | 1202012100200111010000000101 |
4 | 3001332300111300133111 |
5 | 3221400313423410031 |
6 | 44203454553014101 |
7 | 2544035552401414 |
oct | 301766025603725 |
9 | 52170614100011 |
10 | 13330242013141 |
11 | 427a362109089 |
12 | 15b35a70b4331 |
13 | 759062056351 |
14 | 3412897ad47b |
15 | 181b3bd27361 |
hex | c1fb05707d5 |
13330242013141 has 2 divisors, whose sum is σ = 13330242013142. Its totient is φ = 13330242013140.
The previous prime is 13330242013087. The next prime is 13330242013201. The reversal of 13330242013141 is 14131024203331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7615971687025 + 5714270326116 = 2759705^2 + 2390454^2 .
It is a cyclic number.
It is not a de Polignac number, because 13330242013141 - 27 = 13330242013013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13330342013141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6665121006570 + 6665121006571.
It is an arithmetic number, because the mean of its divisors is an integer number (6665121006571).
Almost surely, 213330242013141 is an apocalyptic number.
It is an amenable number.
13330242013141 is a deficient number, since it is larger than the sum of its proper divisors (1).
13330242013141 is an equidigital number, since it uses as much as digits as its factorization.
13330242013141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 13330242013141 its reverse (14131024203331), we get a palindrome (27461266216472).
The spelling of 13330242013141 in words is "thirteen trillion, three hundred thirty billion, two hundred forty-two million, thirteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •