Base | Representation |
---|---|
bin | 11001000010100101… |
… | …00010110101101111 |
3 | 1021200220011001102122 |
4 | 30201102202311233 |
5 | 210013003130221 |
6 | 10101550543155 |
7 | 654066052661 |
oct | 144122426557 |
9 | 37626131378 |
10 | 13443411311 |
11 | 5779500990 |
12 | 2732207abb |
13 | 1363202765 |
14 | 9175d0531 |
15 | 53a33ceab |
hex | 3214a2d6f |
13443411311 has 16 divisors (see below), whose sum is σ = 14922230400. Its totient is φ = 12007600800.
The previous prime is 13443411307. The next prime is 13443411329. The reversal of 13443411311 is 11311434431.
13443411311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 13443411311 - 22 = 13443411307 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (13443411301) 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, 1494056 + ... + 1503026.
It is an arithmetic number, because the mean of its divisors is an integer number (932639400).
Almost surely, 213443411311 is an apocalyptic number.
13443411311 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
13443411311 is a deficient number, since it is larger than the sum of its proper divisors (1478819089).
13443411311 is a wasteful number, since it uses less digits than its factorization.
13443411311 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11350.
The product of its digits is 1728, while the sum is 26.
Adding to 13443411311 its reverse (11311434431), we get a palindrome (24754845742).
The spelling of 13443411311 in words is "thirteen billion, four hundred forty-three million, four hundred eleven thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •