Base | Representation |
---|---|
bin | 1100000110110000110011… |
… | …1001011001011100001111 |
3 | 1202010110021002101001121012 |
4 | 3001230030321121130033 |
5 | 3221034013411221221 |
6 | 44150402051355435 |
7 | 2542432065312413 |
oct | 301541471313417 |
9 | 52113232331535 |
10 | 13310320023311 |
11 | 4271969721283 |
12 | 15ab7672b2b7b |
13 | 75720889319c |
14 | 3403199d2d43 |
15 | 181372d6a65b |
hex | c1b0ce5970f |
13310320023311 has 2 divisors, whose sum is σ = 13310320023312. Its totient is φ = 13310320023310.
The previous prime is 13310320023277. The next prime is 13310320023367. The reversal of 13310320023311 is 11332002301331.
13310320023311 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13310320023311 is a prime.
It is a super-3 number, since 3×133103200233113 (a number of 40 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13310320023391) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6655160011655 + 6655160011656.
It is an arithmetic number, because the mean of its divisors is an integer number (6655160011656).
Almost surely, 213310320023311 is an apocalyptic number.
13310320023311 is a deficient number, since it is larger than the sum of its proper divisors (1).
13310320023311 is an equidigital number, since it uses as much as digits as its factorization.
13310320023311 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 23.
Adding to 13310320023311 its reverse (11332002301331), we get a palindrome (24642322324642).
The spelling of 13310320023311 in words is "thirteen trillion, three hundred ten billion, three hundred twenty million, twenty-three thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •