Base | Representation |
---|---|
bin | 1100000010000101111110… |
… | …0110100100111111111101 |
3 | 1201211210012122022020200011 |
4 | 3000201133212210333331 |
5 | 3213230222411021341 |
6 | 44045454151103221 |
7 | 2533562201611006 |
oct | 300413746447775 |
9 | 51753178266604 |
10 | 13230103220221 |
11 | 42409453a5898 |
12 | 15980ba971b11 |
13 | 74c79386cb24 |
14 | 33a4aa1401ad |
15 | 17e22a823b81 |
hex | c085f9a4ffd |
13230103220221 has 2 divisors, whose sum is σ = 13230103220222. Its totient is φ = 13230103220220.
The previous prime is 13230103220179. The next prime is 13230103220227. The reversal of 13230103220221 is 12202230103231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7107497348121 + 6122605872100 = 2665989^2 + 2474390^2 .
It is a cyclic number.
It is not a de Polignac number, because 13230103220221 - 229 = 13229566349309 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13230103220192 and 13230103220201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13230103220227) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6615051610110 + 6615051610111.
It is an arithmetic number, because the mean of its divisors is an integer number (6615051610111).
Almost surely, 213230103220221 is an apocalyptic number.
It is an amenable number.
13230103220221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13230103220221 is an equidigital number, since it uses as much as digits as its factorization.
13230103220221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 13230103220221 its reverse (12202230103231), we get a palindrome (25432333323452).
The spelling of 13230103220221 in words is "thirteen trillion, two hundred thirty billion, one hundred three million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •