Base | Representation |
---|---|
bin | 1011111010101101010000… |
… | …1011110100010010000001 |
3 | 1201101122200020112212202102 |
4 | 2332223110023310102001 |
5 | 3204140333242322241 |
6 | 43511310455400145 |
7 | 2521450522220306 |
oct | 276532413642201 |
9 | 51348606485672 |
10 | 13103210120321 |
11 | 41a20495707a2 |
12 | 15775a6683055 |
13 | 74082056ac29 |
14 | 3342ad5470ad |
15 | 17aca061d39b |
hex | bead42f4481 |
13103210120321 has 2 divisors, whose sum is σ = 13103210120322. Its totient is φ = 13103210120320.
The previous prime is 13103210120303. The next prime is 13103210120353. The reversal of 13103210120321 is 12302101230131.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6908407708225 + 6194802412096 = 2628385^2 + 2488936^2 .
It is a cyclic number.
It is not a de Polignac number, because 13103210120321 - 238 = 12828332213377 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13103210120293 and 13103210120302.
It is not a weakly prime, because it can be changed into another prime (13103210120821) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6551605060160 + 6551605060161.
It is an arithmetic number, because the mean of its divisors is an integer number (6551605060161).
Almost surely, 213103210120321 is an apocalyptic number.
It is an amenable number.
13103210120321 is a deficient number, since it is larger than the sum of its proper divisors (1).
13103210120321 is an equidigital number, since it uses as much as digits as its factorization.
13103210120321 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13103210120321 its reverse (12302101230131), we get a palindrome (25405311350452).
The spelling of 13103210120321 in words is "thirteen trillion, one hundred three billion, two hundred ten million, one hundred twenty thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •