Base | Representation |
---|---|
bin | 1100000110110111111000… |
… | …1110001100110101010101 |
3 | 1202010122011120222000210011 |
4 | 3001231332032030311111 |
5 | 3221101412123131401 |
6 | 44151314450400221 |
7 | 2542530153026311 |
oct | 301557616146525 |
9 | 52118146860704 |
10 | 13312221302101 |
11 | 4272754970167 |
12 | 15abbb7b90071 |
13 | 75744c753b17 |
14 | 34045a310b41 |
15 | 181434c2c451 |
hex | c1b7e38cd55 |
13312221302101 has 2 divisors, whose sum is σ = 13312221302102. Its totient is φ = 13312221302100.
The previous prime is 13312221302057. The next prime is 13312221302183. The reversal of 13312221302101 is 10120312221331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13254441642225 + 57779659876 = 3640665^2 + 240374^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13312221302101 is a prime.
It is a super-2 number, since 2×133122213021012 (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 (13312221312101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6656110651050 + 6656110651051.
It is an arithmetic number, because the mean of its divisors is an integer number (6656110651051).
Almost surely, 213312221302101 is an apocalyptic number.
It is an amenable number.
13312221302101 is a deficient number, since it is larger than the sum of its proper divisors (1).
13312221302101 is an equidigital number, since it uses as much as digits as its factorization.
13312221302101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
Adding to 13312221302101 its reverse (10120312221331), we get a palindrome (23432533523432).
The spelling of 13312221302101 in words is "thirteen trillion, three hundred twelve billion, two hundred twenty-one million, three hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •