Base | Representation |
---|---|
bin | 1100000000011001101011… |
… | …1001101011001110010001 |
3 | 1201202000011201010212011011 |
4 | 3000012122321223032101 |
5 | 3212241204011423441 |
6 | 44024245422050521 |
7 | 2531512624505305 |
oct | 300063271531621 |
9 | 51660151125134 |
10 | 13201033311121 |
11 | 422a588176927 |
12 | 1592547419a41 |
13 | 749b100a8896 |
14 | 338d0d445d05 |
15 | 17d5c86bc581 |
hex | c019ae6b391 |
13201033311121 has 2 divisors, whose sum is σ = 13201033311122. Its totient is φ = 13201033311120.
The previous prime is 13201033311101. The next prime is 13201033311163. The reversal of 13201033311121 is 12111333010231.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 9565009780225 + 3636023530896 = 3092735^2 + 1906836^2 .
It is a cyclic number.
It is not a de Polignac number, because 13201033311121 - 29 = 13201033310609 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13201033311092 and 13201033311101.
It is not a weakly prime, because it can be changed into another prime (13201033311101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6600516655560 + 6600516655561.
It is an arithmetic number, because the mean of its divisors is an integer number (6600516655561).
Almost surely, 213201033311121 is an apocalyptic number.
It is an amenable number.
13201033311121 is a deficient number, since it is larger than the sum of its proper divisors (1).
13201033311121 is an equidigital number, since it uses as much as digits as its factorization.
13201033311121 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 13201033311121 its reverse (12111333010231), we get a palindrome (25312366321352).
The spelling of 13201033311121 in words is "thirteen trillion, two hundred one billion, thirty-three million, three hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •