Base | Representation |
---|---|
bin | 1100000110010101100111… |
… | …1010110101011001101101 |
3 | 1202002202102111102212022211 |
4 | 3001211121322311121231 |
5 | 3220424042202423041 |
6 | 44143154000210421 |
7 | 2542053202632322 |
oct | 301453172653155 |
9 | 52082374385284 |
10 | 13303022311021 |
11 | 4269864315aa3 |
12 | 15aa26b309a11 |
13 | 7566149b0831 |
14 | 33dc266dab49 |
15 | 181097345481 |
hex | c1959eb566d |
13303022311021 has 2 divisors, whose sum is σ = 13303022311022. Its totient is φ = 13303022311020.
The previous prime is 13303022311001. The next prime is 13303022311037. The reversal of 13303022311021 is 12011322030331.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11633461137796 + 1669561173225 = 3410786^2 + 1292115^2 .
It is a cyclic number.
It is not a de Polignac number, because 13303022311021 - 25 = 13303022310989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13303022310983 and 13303022311001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13303022311001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6651511155510 + 6651511155511.
It is an arithmetic number, because the mean of its divisors is an integer number (6651511155511).
Almost surely, 213303022311021 is an apocalyptic number.
It is an amenable number.
13303022311021 is a deficient number, since it is larger than the sum of its proper divisors (1).
13303022311021 is an equidigital number, since it uses as much as digits as its factorization.
13303022311021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 13303022311021 its reverse (12011322030331), we get a palindrome (25314344341352).
The spelling of 13303022311021 in words is "thirteen trillion, three hundred three billion, twenty-two million, three hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •