Base | Representation |
---|---|
bin | 1100001000101100001000… |
… | …0000011011010011001101 |
3 | 1202020121201010001102021012 |
4 | 3002023002000123103031 |
5 | 3222104312332004401 |
6 | 44213514542015005 |
7 | 2545013316530360 |
oct | 302130200332315 |
9 | 52217633042235 |
10 | 13343423313101 |
11 | 4284a06663912 |
12 | 15b6065577465 |
13 | 75a382b6581b |
14 | 341b7a2500d7 |
15 | 18215e13c8bb |
hex | c22c201b4cd |
13343423313101 has 16 divisors (see below), whose sum is σ = 15661092925440. Its totient is φ = 11131339213680.
The previous prime is 13343423313023. The next prime is 13343423313119. The reversal of 13343423313101 is 10131332434331.
It is a happy number.
It is not a de Polignac number, because 13343423313101 - 234 = 13326243443917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13343423313161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 113230265 + ... + 113348046.
It is an arithmetic number, because the mean of its divisors is an integer number (978818307840).
Almost surely, 213343423313101 is an apocalyptic number.
It is an amenable number.
13343423313101 is a deficient number, since it is larger than the sum of its proper divisors (2317669612339).
13343423313101 is a wasteful number, since it uses less digits than its factorization.
13343423313101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 226578544.
The product of its (nonzero) digits is 23328, while the sum is 32.
Adding to 13343423313101 its reverse (10131332434331), we get a palindrome (23474755747432).
The spelling of 13343423313101 in words is "thirteen trillion, three hundred forty-three billion, four hundred twenty-three million, three hundred thirteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •