Base | Representation |
---|---|
bin | 1100001000000001100110… |
… | …1110110111010001101101 |
3 | 1202012112020201021022102211 |
4 | 3002000121232313101231 |
5 | 3221412424102432341 |
6 | 44204350235250421 |
7 | 2544130432635544 |
oct | 302003156672155 |
9 | 52175221238384 |
10 | 13332010202221 |
11 | 428008a215777 |
12 | 15b39bb2a9a11 |
13 | 759284489089 |
14 | 3413b656515b |
15 | 181be219a181 |
hex | c2019bb746d |
13332010202221 has 2 divisors, whose sum is σ = 13332010202222. Its totient is φ = 13332010202220.
The previous prime is 13332010202207. The next prime is 13332010202261. The reversal of 13332010202221 is 12220201023331.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 13330020060900 + 1990141321 = 3651030^2 + 44611^2 .
It is a cyclic number.
It is not a de Polignac number, because 13332010202221 - 221 = 13332008105069 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13332010202192 and 13332010202201.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13332010202261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6666005101110 + 6666005101111.
It is an arithmetic number, because the mean of its divisors is an integer number (6666005101111).
Almost surely, 213332010202221 is an apocalyptic number.
It is an amenable number.
13332010202221 is a deficient number, since it is larger than the sum of its proper divisors (1).
13332010202221 is an equidigital number, since it uses as much as digits as its factorization.
13332010202221 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 13332010202221 its reverse (12220201023331), we get a palindrome (25552211225552).
The spelling of 13332010202221 in words is "thirteen trillion, three hundred thirty-two billion, ten million, two hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •