Base | Representation |
---|---|
bin | 1100000110001110110101… |
… | …0111001010010010011101 |
3 | 1202002120201120100200211002 |
4 | 3001203231113022102131 |
5 | 3220411324430120221 |
6 | 44142253135440045 |
7 | 2541660106131203 |
oct | 301435527122235 |
9 | 52076646320732 |
10 | 13301201020061 |
11 | 426900a23a159 |
12 | 15a9a41386025 |
13 | 7563b4577886 |
14 | 33dad2881073 |
15 | 180edc4d380b |
hex | c18ed5ca49d |
13301201020061 has 2 divisors, whose sum is σ = 13301201020062. Its totient is φ = 13301201020060.
The previous prime is 13301201019979. The next prime is 13301201020087. The reversal of 13301201020061 is 16002010210331.
13301201020061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 13265293044025 + 35907976036 = 3642155^2 + 189494^2 .
It is a cyclic number.
It is not a de Polignac number, because 13301201020061 - 210 = 13301201019037 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (13301201050061) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6650600510030 + 6650600510031.
It is an arithmetic number, because the mean of its divisors is an integer number (6650600510031).
Almost surely, 213301201020061 is an apocalyptic number.
It is an amenable number.
13301201020061 is a deficient number, since it is larger than the sum of its proper divisors (1).
13301201020061 is an equidigital number, since it uses as much as digits as its factorization.
13301201020061 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 13301201020061 its reverse (16002010210331), we get a palindrome (29303211230392).
The spelling of 13301201020061 in words is "thirteen trillion, three hundred one billion, two hundred one million, twenty thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •