Base | Representation |
---|---|
bin | 11000110010110101… |
… | …00101011100100011 |
3 | 1021100200120011201101 |
4 | 30121122211130203 |
5 | 204230143121121 |
6 | 10040511215231 |
7 | 650603123632 |
oct | 143132453443 |
9 | 37320504641 |
10 | 13311301411 |
11 | 5710978851 |
12 | 26b5b17517 |
13 | 1341a28815 |
14 | 903c41519 |
15 | 52d944491 |
hex | 3196a5723 |
13311301411 has 8 divisors (see below), whose sum is σ = 13674883680. Its totient is φ = 12947920128.
The previous prime is 13311301403. The next prime is 13311301429. The reversal of 13311301411 is 11410311331.
It is a happy number.
13311301411 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 13311301411 - 23 = 13311301403 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13311301481) 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, 89235 + ... + 185971.
It is an arithmetic number, because the mean of its divisors is an integer number (1709360460).
Almost surely, 213311301411 is an apocalyptic number.
13311301411 is a deficient number, since it is larger than the sum of its proper divisors (363582269).
13311301411 is an equidigital number, since it uses as much as digits as its factorization.
13311301411 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 100493.
The product of its (nonzero) digits is 108, while the sum is 19.
Adding to 13311301411 its reverse (11410311331), we get a palindrome (24721612742).
The spelling of 13311301411 in words is "thirteen billion, three hundred eleven million, three hundred one thousand, four hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •