Base | Representation |
---|---|
bin | 11000110011011010… |
… | …10100001101010101 |
3 | 1021101000210122011001 |
4 | 30121231110031111 |
5 | 204232422232131 |
6 | 10041204343301 |
7 | 650662634113 |
oct | 143155241525 |
9 | 37330718131 |
10 | 13316211541 |
11 | 5713721906 |
12 | 26b76a4b31 |
13 | 1342a57719 |
14 | 90475cab3 |
15 | 52e0b4261 |
hex | 319b54355 |
13316211541 has 8 divisors (see below), whose sum is σ = 14469228800. Its totient is φ = 12208410720.
The previous prime is 13316211539. The next prime is 13316211551. The reversal of 13316211541 is 14511261331.
13316211541 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13316211541 - 21 = 13316211539 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 (13316211511) 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 7 ways as a sum of consecutive naturals, for example, 11303496 + ... + 11304673.
It is an arithmetic number, because the mean of its divisors is an integer number (1808653600).
Almost surely, 213316211541 is an apocalyptic number.
It is an amenable number.
13316211541 is a deficient number, since it is larger than the sum of its proper divisors (1153017259).
13316211541 is a wasteful number, since it uses less digits than its factorization.
13316211541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22608219.
The product of its digits is 2160, while the sum is 28.
Adding to 13316211541 its reverse (14511261331), we get a palindrome (27827472872).
The spelling of 13316211541 in words is "thirteen billion, three hundred sixteen million, two hundred eleven thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •