Base | Representation |
---|---|
bin | 11001011010011010… |
… | …01001110110000001 |
3 | 1022012211022201011222 |
4 | 30231031021312001 |
5 | 210420142343201 |
6 | 10133451444425 |
7 | 662044230101 |
oct | 145515116601 |
9 | 38184281158 |
10 | 13643324801 |
11 | 5871334947 |
12 | 2789156715 |
13 | 1395759572 |
14 | 935d8d201 |
15 | 54cb7b91b |
hex | 32d349d81 |
13643324801 has 4 divisors (see below), whose sum is σ = 13783977732. Its totient is φ = 13502671872.
The previous prime is 13643324797. The next prime is 13643324803. The reversal of 13643324801 is 10842334631.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 10842334631 = 43 ⋅252147317.
It can be written as a sum of positive squares in 2 ways, for example, as 10925266576 + 2718058225 = 104524^2 + 52135^2 .
It is a cyclic number.
It is not a de Polignac number, because 13643324801 - 22 = 13643324797 is a prime.
It is a super-2 number, since 2×136433248012 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13643324803) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 70326320 + ... + 70326513.
It is an arithmetic number, because the mean of its divisors is an integer number (3445994433).
Almost surely, 213643324801 is an apocalyptic number.
It is an amenable number.
13643324801 is a deficient number, since it is larger than the sum of its proper divisors (140652931).
13643324801 is an equidigital number, since it uses as much as digits as its factorization.
13643324801 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 140652930.
The product of its (nonzero) digits is 41472, while the sum is 35.
The spelling of 13643324801 in words is "thirteen billion, six hundred forty-three million, three hundred twenty-four thousand, eight hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •