Base | Representation |
---|---|
bin | 1011111010100001101101… |
… | …1110000010110001110101 |
3 | 1201101100200021020000100211 |
4 | 2332220123132002301311 |
5 | 3204113011421111313 |
6 | 43510035153105421 |
7 | 2521310652126436 |
oct | 276503336026165 |
9 | 51340607200324 |
10 | 13100111113333 |
11 | 41a07a92279a2 |
12 | 1576a80858271 |
13 | 7404484ccb9a |
14 | 334097b2b48d |
15 | 17ab6d51de3d |
hex | bea1b782c75 |
13100111113333 has 2 divisors, whose sum is σ = 13100111113334. Its totient is φ = 13100111113332.
The previous prime is 13100111113319. The next prime is 13100111113381. The reversal of 13100111113333 is 33331111100131.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8714345328049 + 4385765785284 = 2952007^2 + 2094222^2 .
It is a cyclic number.
It is not a de Polignac number, because 13100111113333 - 213 = 13100111105141 is a prime.
It is a super-2 number, since 2×131001111133332 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13100111117333) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6550055556666 + 6550055556667.
It is an arithmetic number, because the mean of its divisors is an integer number (6550055556667).
Almost surely, 213100111113333 is an apocalyptic number.
It is an amenable number.
13100111113333 is a deficient number, since it is larger than the sum of its proper divisors (1).
13100111113333 is an equidigital number, since it uses as much as digits as its factorization.
13100111113333 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 243, while the sum is 22.
Adding to 13100111113333 its reverse (33331111100131), we get a palindrome (46431222213464).
The spelling of 13100111113333 in words is "thirteen trillion, one hundred billion, one hundred eleven million, one hundred thirteen thousand, three hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •