Base | Representation |
---|---|
bin | 11000110010110101… |
… | …01010110010101001 |
3 | 1021100200121021202021 |
4 | 30121122222302221 |
5 | 204230144321210 |
6 | 10040511504441 |
7 | 650603244520 |
oct | 143132526251 |
9 | 37320537667 |
10 | 13311323305 |
11 | 5710993245 |
12 | 26b5b28121 |
13 | 1341a35787 |
14 | 903c494b7 |
15 | 52d94abda |
hex | 3196aaca9 |
13311323305 has 32 divisors (see below), whose sum is σ = 18448404480. Its totient is φ = 9031738560.
The previous prime is 13311323299. The next prime is 13311323339. The reversal of 13311323305 is 50332311331.
13311323305 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 13311323305 - 27 = 13311323177 is a prime.
It is a super-2 number, since 2×133113233052 (a number of 21 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 13311323305.
It is an unprimeable number.
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 31 ways as a sum of consecutive naturals, for example, 1641972 + ... + 1650058.
It is an arithmetic number, because the mean of its divisors is an integer number (576512640).
Almost surely, 213311323305 is an apocalyptic number.
It is an amenable number.
13311323305 is a deficient number, since it is larger than the sum of its proper divisors (5137081175).
13311323305 is a wasteful number, since it uses less digits than its factorization.
13311323305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8589.
The product of its (nonzero) digits is 2430, while the sum is 25.
Adding to 13311323305 its reverse (50332311331), we get a palindrome (63643634636).
The spelling of 13311323305 in words is "thirteen billion, three hundred eleven million, three hundred twenty-three thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •