Base | Representation |
---|---|
bin | 11000110011000100… |
… | …10000001001100011 |
3 | 1021100211100021210212 |
4 | 30121202100021203 |
5 | 204231201430311 |
6 | 10041022244335 |
7 | 650626164515 |
oct | 143142201143 |
9 | 37324307725 |
10 | 13313311331 |
11 | 5712020941 |
12 | 26b67266ab |
13 | 1342280618 |
14 | 904205bb5 |
15 | 52dbdec8b |
hex | 319890263 |
13313311331 has 8 divisors (see below), whose sum is σ = 13374648000. Its totient is φ = 13252041000.
The previous prime is 13313311307. The next prime is 13313311369. The reversal of 13313311331 is 13311331331.
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 13313311331 - 214 = 13313294947 is a prime.
It is a super-2 number, since 2×133133113312 (a number of 21 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 13313311297 and 13313311306.
It is not an unprimeable number, because it can be changed into a prime (13313311831) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 410840 + ... + 442058.
It is an arithmetic number, because the mean of its divisors is an integer number (1671831000).
Almost surely, 213313311331 is an apocalyptic number.
13313311331 is a deficient number, since it is larger than the sum of its proper divisors (61336669).
13313311331 is a wasteful number, since it uses less digits than its factorization.
13313311331 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33169.
The product of its digits is 729, while the sum is 23.
Adding to 13313311331 its reverse (13311331331), we get a palindrome (26624642662).
The spelling of 13313311331 in words is "thirteen billion, three hundred thirteen million, three hundred eleven thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •