Base | Representation |
---|---|
bin | 11000110100000000… |
… | …00000101011111001 |
3 | 1021101101000121202010 |
4 | 30122000000223321 |
5 | 204240201043223 |
6 | 10041501400133 |
7 | 651052405065 |
oct | 143200005371 |
9 | 37341017663 |
10 | 13321112313 |
11 | 5716469933 |
12 | 26b9269049 |
13 | 1343a822a2 |
14 | 905276aa5 |
15 | 52e731393 |
hex | 31a000af9 |
13321112313 has 8 divisors (see below), whose sum is σ = 17762025888. Its totient is φ = 8880470144.
The previous prime is 13321112309. The next prime is 13321112323. The reversal of 13321112313 is 31321112331.
It is a happy number.
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 13321112313 - 22 = 13321112309 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 13321112313.
It is not an unprimeable number, because it can be changed into a prime (13321112323) 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, 124906 + ... + 205532.
It is an arithmetic number, because the mean of its divisors is an integer number (2220253236).
Almost surely, 213321112313 is an apocalyptic number.
It is an amenable number.
13321112313 is a deficient number, since it is larger than the sum of its proper divisors (4440913575).
13321112313 is an equidigital number, since it uses as much as digits as its factorization.
13321112313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135703.
The product of its digits is 324, while the sum is 21.
Adding to 13321112313 its reverse (31321112331), we get a palindrome (44642224644).
The spelling of 13321112313 in words is "thirteen billion, three hundred twenty-one million, one hundred twelve thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •